On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
From MaRDI portal
Publication:5585878
DOI10.1287/mnsc.16.5.295zbMath0191.48402OpenAlexW2091055122MaRDI QIDQ5585878
Publication date: 1970
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.16.5.295
Related Items (7)
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs ⋮ A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs ⋮ Equitable scheduling on a single machine ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ Minimizing functions of infeasibilities in a two-machine flow shop
This page was built for publication: On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs