an:05612743
Zbl 1176.90232
Mayer, Eckart; Haus, Utz-Uwe; Raisch, J??rg; Weismantel, Robert
Throughput-optimal sequences for cyclically operated plants
EN
Discrete Event Dyn. Syst. 18, No. 3, 355-383 (2008).
00222620
2008
j
90B35 90C10 93C65
cyclic scheduling; high throughput screening; integer programming
Summary: In this paper, we present a method to determine globally optimal schedules for cyclically operated plants where activities have to be scheduled on limited resources. In cyclic operation, a large number of entities is processed in an identical time scheme. For strictly cyclic operation, where the time offset between entities is also identical for all entities, the objective of maximizing throughput is equivalent to the minimization of the cycle time. The resulting scheduling problem is solved by deriving a mixed integer optimization problem from a discrete event model. The model includes timing constraints as well as open sequence decisions for the activities on the resources. In an extension, hierarchical nesting of cycles is considered, which often allows for schedules with improved throughput. The method is motivated by the application to high throughput screening plants, where a specific combination of requirements has to be obeyed (e.g. revisited resources, absence of buffers, or time window constraints).