Sciweavers

1125 search results - page 23 / 225
» On the job rotation problem
Sort
View
COR
2006
86views more  COR 2006»
13 years 10 months ago
Minimizing the earliness-tardiness costs on a single machine
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consist...
Jakub Bauman, Joanna Józefowska
ICIP
2000
IEEE
14 years 11 months ago
A Novel Scheme for Image Rotation for Document Processing
Rotation of the binary image of a document page for correcting the skew in the case of OCR or signature verification systems entails disfigurement of the shape of the characters, ...
Kaushik Mahata, A. G. Ramakrishnan
CAV
2001
Springer
107views Hardware» more  CAV 2001»
14 years 2 months ago
Job-Shop Scheduling Using Timed Automata
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
Yasmina Abdeddaïm, Oded Maler
GRID
2008
Springer
13 years 11 months ago
User- and job-centric monitoring: Analysing and presenting large amounts of monitoring data
For data analysis or simulations (e.g. in particle physics) single users submit hundreds or thousands of jobs to the Grid. This puts a new burden on the users side - keeping an ov...
Henrik Eichenhardt, Ralph Müller-Pfefferkorn,...
EOR
2007
82views more  EOR 2007»
13 years 9 months ago
Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
: New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, a...
Jeffrey D. Laub, John W. Fowler, Ahmet B. Keha