Interstage transportation planning in the deterministic flow-shop environment
Operations Research
Parallel machines scheduling with nonsimultaneous machine available time
Discrete Applied Mathematics
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
Theoretical Computer Science
Scheduling Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An improved heuristic for two-machine flowshop scheduling with an availability constraint
Operations Research Letters
Operations Research Letters
Two-machine open shop scheduling with an availability constraint
Operations Research Letters
Computers and Industrial Engineering
International Journal of Computer Integrated Manufacturing - Industrial Engineering and Systems Management
Computers and Industrial Engineering
Scheduling hybrid flowshop with parallel batching machines and compatibilities
Computers and Operations Research
Scheduling of a single crane in batch annealing process
Computers and Operations Research
Robotics and Computer-Integrated Manufacturing
Hi-index | 0.02 |
Most of the literature on scheduling assumes that machines are always available. However, in real life industry, machines may be subject to some unavailability periods due to maintenance activities such as breakdowns (stochastic case) and preventive maintenance (deterministic case). In this paper we investigate the two-stage hybrid flow shop scheduling problem with only one machine on the first stage and m machines on the second stage to minimize the makespan. We consider that each machine is subject to at most one unavailability period. The start time and the end time of each period are known in advance (deterministic case) and only the non-resumable case is studied. First we discuss the complexity of the problem. Afterwards, we give the Branch and Bound model for this problem. Last, we calculate the worst-case performances of three heuristics: LIST algorithm, LPT algorithm and H-heuristic.