A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem

DOI10.1016/S0305-0548(97)00028-2zbMath0907.90184MaRDI QIDQ1265840

Christos P. Koulamas

Publication date: 27 September 1998

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

two-machine flowshoptotal tardinessguaranteed accuracy shifting bottleneck algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines

Cites Work

• Unnamed Item
• Unnamed Item
• The two-machine flowshop scheduling problem with total tardiness
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• A decomposition algorithm for the single machine total tardiness problem
• Optimal two- and three-stage production schedules with setup times included
• Minimizing Total Tardiness on One Machine is NP-Hard
• The Total Tardiness Problem: Review and Extensions
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
• A $k$-Sample Model in Order Statistics

This page was built for publication: A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem