New results in the worst-case analysis for flow-shop scheduling
From MaRDI portal
Publication:689950
DOI10.1016/0166-218X(93)90156-IzbMath0848.68009MaRDI QIDQ689950
Eugeniusz Nowicki, Czesław Smutnicki
Publication date: 8 October 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (11)
A note on worst-case analysis of approximation algorithms for a scheduling problem ⋮ Experimental comparison of heuristics for flow shop scheduling ⋮ Minimizing maximum completion time in a proportionate flow shop with one machine of different speed ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ A fast tabu search algorithm for the permutation flow-shop problem ⋮ A linear time approximation algorithm for permutation flow shop scheduling ⋮ A two-machine permutation flow shop scheduling problem with buffers ⋮ A new constructive heuristic for the flowshop scheduling problem ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ Performance guarantees for flowshop heuristics to minimize makespan
Cites Work
- Unnamed Item
- Unnamed Item
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- Optimal two- and three-stage production schedules with setup times included
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
- Flowshop and Jobshop Schedules: Complexity and Approximation
- An Evaluation of Flow Shop Sequencing Heuristics
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
This page was built for publication: New results in the worst-case analysis for flow-shop scheduling
