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...
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, ...
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...
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...
: 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...