Worst-case analysis of an approximation algorithm for flow-shop scheduling
From MaRDI portal
Publication:1121778
DOI10.1016/0167-6377(89)90045-XzbMath0674.90047OpenAlexW2001516562MaRDI QIDQ1121778
Eugeniusz Nowicki, Czesław Smutnicki
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(89)90045-x
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items (15)
A note on worst-case analysis of approximation algorithms for a scheduling problem ⋮ A worst-case analysis of the three-machine flow shop scheduling ⋮ Experimental comparison of heuristics for flow shop scheduling ⋮ Minimizing maximum completion time in a proportionate flow shop with one machine of different speed ⋮ Using aggregation to reduce response time variability in cyclic fair sequences ⋮ Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling ⋮ New results in the worst-case analysis for flow-shop scheduling ⋮ How good is a dense shop schedule? ⋮ A fast tabu search algorithm for the permutation flow-shop problem ⋮ A linear time approximation algorithm for permutation flow shop scheduling ⋮ A new constructive heuristic for the flowshop scheduling problem ⋮ Scheduling in network flow shops ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ Performance guarantees for flowshop heuristics to minimize makespan ⋮ An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
Cites Work
This page was built for publication: Worst-case analysis of an approximation algorithm for flow-shop scheduling
