Interstage transportation planning in the deterministic flow-shop environment
Operations Research
Parallel machines scheduling with nonsimultaneous machine available time
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing makespan in hybrid flowshops
Operations Research Letters
An improved heuristic for two-machine flowshop scheduling with an availability constraint
Operations Research Letters
Operations Research Letters
Computers and Operations Research
Application of EM algorithm to hybrid flow shop scheduling problems with a special blocking
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
A survey of scheduling with deterministic machine availability constraints
Computers and Industrial Engineering
Fuzzy job shop scheduling problem with availability constraints
Computers and Industrial Engineering
Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability
Computers and Industrial Engineering
Incorporating periodic preventive maintenance into flexible flowshop scheduling problems
Applied Soft Computing
A heuristic method for two-stage hybrid flow shop with dedicated machines
Computers and Operations Research
A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem
Computers and Operations Research
| Hi-index | 0.01 |
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.