On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs

DOI10.1287/MNSC.16.5.295MaRDI QIDQ5585878zbMATH OpenOpenAlexFDO

Authors William L. Maxwell

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

zbMATH Keywords

operations research

Cited in

(8)

• Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs
• Minimizing functions of infeasibilities in a two-machine flow shop
• A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Equitable scheduling on a single machine
• Theory and methodology of time-dependent scheduling: past, present and future

This page was built for publication: On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs

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