Cyclic schedules for job shops with identical jobs
Mathematics of Operations Research
A parametric critical path problem and an application for cyclic scheduling
Discrete Applied Mathematics
Scheduling Algorithms
Time-optimal scheduling for high throughput screening processes using cyclic discrete event models
Mathematics and Computers in Simulation - Special issue: Selected papers from the 4th IMACS symposium on mathematical modelling (4th MATHMOD)
Survey: Complexity of cyclic scheduling problems: A state-of-the-art survey
Computers and Industrial Engineering
Networked conflicting timed event graphs representation in (Max,+) algebra
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
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).