zbMATH — the first resource for mathematics

Time-optimal scheduling for high throughput screening processes using cyclic discrete event models. (English) Zbl 1048.90106
Summary: 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.
Based on discrete events systems modeling, this job shop scheduling problem can be formulated as a mixed integer linear optimization problem. Throughput is maximized by minimization of the cycle time. The method is applied to high throughput screening problems and illustrated by means of a small example.

MSC:
 90B35 Deterministic scheduling theory in operations research 90C11 Mixed integer programming 90C90 Applications of mathematical programming
Full Text:
References:
 [1] A. Donzel, J. Carmona, L.A. Corkan, Perspectives on scheduling, in: J.P. Devlin (Ed.), High throughput screening, Marcel Dekker, New York, 1997, 525-544. [2] Ierapetritou, M.G; Floudas, C.A, Effective continuous-time formulation for short-term scheduling. 1. multipurpose batch processes, Ind. eng. chem. res., 37, 4341-4359, (1998) [3] Murray, C; Anderson, C, Scheduling software for high-throughput screening, Laboratory robotics & automation, 8, 5, 295-305, (1996) [4] Schilling, G; Pantelides, C.C, Optimal periodic scheduling of multipurpose plants, Computers and chemical engineering, 23, 635-655, (1999)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.