An improved NEH heuristic to minimize makespan in permutation flow shops
Computers and Operations Research
Tight Bounds for Permutation Flow Shop Scheduling
Mathematics of Operations Research
Tight bounds for permutation flow shop scheduling
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A linear time approximation algorithm for permutation flow shop scheduling
Theoretical Computer Science
Hi-index | 0.05 |