The Three-Machine No-Wait Flow Shop is NP-Complete
Journal of the ACM (JACM)
Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Tabu Search
New heuristics for no-wait flowshops to minimize makespan
Computers and Operations Research
Computers and Industrial Engineering
Some local search algorithms for no-wait flow-shop problem with makespan criterion
Computers and Operations Research
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
Computers and Operations Research
Minimizing Makespan in No-Wait Job Shops
Mathematics of Operations Research
Approximative procedures for no-wait job shop scheduling
Operations Research Letters
Inapproximability results for no-wait job shop scheduling
Operations Research Letters
| Hi-index | 0.01 |
This paper examines the problem of scheduling two-machine no-wait job shops to minimize makespan. The problem is known to be strongly NP-hard. A two-phase heuristic is developed to solve the problem. Phase 1 of the heuristic transforms the problem into a no-wait flow shop problem and solves it using the well known Gilmore and Gomory algorithm. Phase 2 of the heuristic improves the solution obtained in phase 1 using a simple tabu search algorithm. Computational results show that the proposed heuristic performs extremely well in terms of both solution quality and computation time. It finds an optimal solution to about 90% of the problem instances and the average deviation from the lower bond for the other problem instances is infinitesimal.