Time-optimal scheduling for high throughput screening processes using cyclic discrete event models
A method for solving the scheduling problem for a class of cyclic systems with respect to throughput maximization is presented. A strictly cyclic mode of operation is considered, where the time offset between the start of consecutive jobs is always constant. All jobs have to follow an identical time scheme. The time scheme may be restricted by due dates or time window constraints. There are no buffers between the resources of the system.
Year of publication: |
2004
|
---|---|
Authors: | Mayer, E ; Raisch, J |
Published in: |
Mathematics and Computers in Simulation (MATCOM). - Elsevier, ISSN 0378-4754. - Vol. 66.2004, 2, p. 181-191
|
Publisher: |
Elsevier |
Subject: | Cyclic scheduling | Throughput maximization | Mixed integer optimization | Discrete event systems | High throughput screening |
Saved in:
Saved in favorites
Similar items by subject
-
Robots in the laboratory: a review of applications
Bogue, Robert, (2012)
-
Cyclic scheduling of parts and robot moves in m-machine robotic cells
Gultekin, Hakan, (2018)
-
A general framework for statistical inference on discrete event systems.
Nicolai, R.P., (2006)
- More ...