Time-optimal scheduling for high throughput screening processes using cyclic discrete event models

E Mayer and J Raisch

Mathematics and Computers in Simulation (MATCOM), 2004, vol. 66, issue 2, 181-191

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

Keywords: Cyclic scheduling; Throughput maximization; Mixed integer optimization; Discrete event systems; High throughput screening (search for similar items in EconPapers)
Date: 2004
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475403002039
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:66:y:2004:i:2:p:181-191

DOI: 10.1016/j.matcom.2003.11.004

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().