Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling

DOI10.1016/0167-6377(91)90025-KzbMath0772.90054OpenAlexW1979770131MaRDI QIDQ1183390

Czesław Smutnicki, Eugeniusz Nowicki

Publication date: 28 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90025-k

zbMATH Keywords

approximation algorithmNP-hardheuristic algorithmsworst case analysisDannenbring's algorithmpermutation flow-shop schedulingrapid access algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

A note on worst-case analysis of approximation algorithms for a scheduling problem ⋮ Experimental comparison of heuristics for flow shop scheduling ⋮ New results in the worst-case analysis for flow-shop scheduling ⋮ A linear time approximation algorithm for permutation flow shop scheduling ⋮ A new constructive heuristic for the flowshop scheduling problem ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ Non-bottleneck machines in three-machine flow shops ⋮ Performance guarantees for flowshop heuristics to minimize makespan

Cites Work

• Worst-case analysis of an approximation algorithm for flow-shop scheduling
• A decision support system for the resource constrained project scheduling problem
• An Evaluation of Flow Shop Sequencing Heuristics
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling