Random number generators: good ones are hard to find
Communications of the ACM
Sequencing in an assembly line with blocking to minimize cycle time
Operations Research
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
Tabu Search Algorithms for Cyclic Machine Scheduling Problems
Journal of Scheduling
A general model for cyclic machine scheduling problems
Discrete Applied Mathematics
Introduction to Scheduling
Formal Approach of FMS Cyclic Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
| Hi-index | 0.04 |
This paper focuses on the study of cyclic job-shop problems with transportation and blocking. Within this domain, there are many real world problems like large scale productions, robotic cells, software pipelining or hoist scheduling. The aim in general is to find, for each machine, a feasible order of all the operations processed on this machine, so that an objective function is optimised. In this paper, we consider the problem of minimising the cycle time (maximising the throughput) in a job-shop environment, where the jobs are transported by a single robot between the machines. Additionally to the problem description, we will give some explanations and interpretation possibilities of the problem height, which is often omitted in the literature. As the main contribution, we will present a new integer programming formulation and show that it outperforms an existing model from the literature.