A total tardiness problem with preprocessing included

DOI10.1002/(SICI)1520-6750(199608)43:5%3C721::AID-NAV8%3E3.0.CO;2-7MaRDI QIDQ5687645zbMATH OpenOpenAlexFDO

Authors C. Koulamas

Publication date 21 January 1997

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199608)43:5%3C721::aid-nav8%3E3.0.co;2-7

zbMATH Keywords

average job completion timebranch-and-boundpolynomial-time heuristictwo-machine flow-shop total tardiness problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The two-machine flowshop scheduling problem with total tardiness
• Minimizing tardiness in a two-machine flow-shop
• Minimizing the total flow time and the tardiness in a two-machine flow shop
• Two-machine flowshop scheduling to minimize total tardiness
• The proportionate flow shop total tardiness problem

Cited in

(1)

• Minimizing tardiness in a two-machine flow-shop

This page was built for publication: A total tardiness problem with preprocessing included

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5687645)