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. Based on discrete events systems (DES) 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 (HTS) problems and illustrated by means of a small example. (C) 2003 IMACS. Published by Elsevier B.V. All rights reserved.
high throughput screening throughput maximization discrete event systems cyclic scheduling mixed integer optimization