Minimising the Maximum Penalty in the Two-Machine Flow Shop
From MaRDI portal
Publication:4158785
DOI10.1287/mnsc.24.2.230zbMath0379.90053OpenAlexW2019595070MaRDI QIDQ4158785
Publication date: 1977
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.24.2.230
Related Items
Asymptotically anti-de Sitter spaces ⋮ An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system ⋮ Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm
