Minimizing the total flow time and the tardiness in a two-machine flow shop

DOI10.1080/002077201300029746zbMath1005.90037OpenAlexW2153322221MaRDI QIDQ3153828

No author found.

Publication date: 2001

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002077201300029746

zbMATH Keywords

branch-and-bound algorithmflow shop

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Two machine flow shop scheduling problem with weighted WIP costs ⋮ Flow shops with WIP and value added costs

This page was built for publication: Minimizing the total flow time and the tardiness in a two-machine flow shop