Some local search algorithms for no-wait flow-shop problem with makespan criterion
Computers and Operations Research
Minimizing Makespan in No-Wait Job Shops
Mathematics of Operations Research
The Directed Minimum Latency Problem
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
A DE-based approach to no-wait flow-shop scheduling
Computers and Industrial Engineering
Inapproximability results for no-wait job shop scheduling
Operations Research Letters
No-Wait flowshop scheduling is as hard as asymmetric traveling salesman problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We investigate the approximability of a no-wait permutation flow shop scheduling problem under the makespan criterion. We present a polynomial time approximation scheme (PTAS) for the problem on any fixed number of machines.