Minimizing Total Completion Time in a Two-Machine
Mathematics of Operations Research
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
A heuristic method for two-stage hybrid flow shop with dedicated machines
Computers and Operations Research
A two-stage hybrid flow shop with dedicated machines at the first stage
Computers and Operations Research
Hi-index | 0.01 |
We consider the problem of minimizing total completion time in a two-stage hybrid flow shop scheduling problem with dedicated machines at stage 2. There exist one machine at stage 1 and two machines at stage 2. Each job must be processed on the single machine at stage 1 and depending upon the job type, the job is processed on either of the two machines at stage 2. First, we introduce the problem and establish complexity of several variations of the problem. For the general case, we introduce two heuristics and find a worst case bound on relative error for each of the heuristics. Then, we find optimal solution procedures for some special cases. We also develop a heuristic for a special case where processing times on machine 1 are identical and find a worst case bound on relative error. Finally, we empirically evaluate the heuristics.