A general model for cyclic machine scheduling problems

Authors:
Peter Brucker;Thomas Kampmeyer
Affiliations:
Universität Osnabrück, Fachbereich Mathematik/Informatik, 49069 Osnabrück, Germany;Bayer Technology Services, 51373 Leverkusen, Germany
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 7
Cited 5

Sequencing in an assembly line with blocking to minimize cycle time

Operations Research
The basic cyclic scheduling problem with deadlines

ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
Petri net modeling and scheduling for cyclic job shops with blocking

Computers and Industrial Engineering
Scheduling Parallel Computations

Journal of the ACM (JACM)
A tabu search algorithm for scheduling a single robot in a job-shop environment

Discrete Applied Mathematics
Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach

Operations Research
Tabu Search Algorithms for Cyclic Machine Scheduling Problems

Journal of Scheduling

Optimal cyclic multiple hoist scheduling for processes with loops and parallel resources

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
A hybridization of simulated annealing and electromagnetism-like mechanism for a periodic job shop scheduling problem

Expert Systems with Applications: An International Journal
A mixed integer programming model for the cyclic job-shop problem with transportation

Discrete Applied Mathematics
Two-machine robotic cell scheduling problem with sequence-dependent setup times

Computers and Operations Research
CROSS cyclic resource-constrained scheduling solver

Artificial Intelligence

Quantified Score

Hi-index	0.05

Visualization

Abstract

A general framework for modeling and solving cyclic scheduling problems is presented. The objective is to minimize the cycle time. The model covers different cyclic versions of the job-shop problem found in the literature, robotic cell problems, the single hoist scheduling problem and tool transportation between the machines. It is shown that all these problems can be formulated as mixed integer linear programs which have a common structure. Small instances are solved with CPLEX. For larger instances tabu search procedures have been developed. The main ideas of these methods are indicated.