A Simple Optimality Proof of Moore's Sequencing Algorithm
From MaRDI portal
Publication:5613006
DOI10.1287/mnsc.17.1.116zbMath0211.52001OpenAlexW1972620744MaRDI QIDQ5613006
Publication date: 1970
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.17.1.116
Related Items (14)
Scheduling jobs under simple linear deterioration ⋮ 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 ⋮ Minimizing the weighted number of tardy jobs on a single machine with release dates ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Single Machine Stochastic Scheduling: Minimizing the 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 ⋮ Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance ⋮ Scheduling problems with position dependent job processing times: computational complexity results ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times ⋮ Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs ⋮ Scheduling jobs under decreasing linear deterioration ⋮ Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
This page was built for publication: A Simple Optimality Proof of Moore's Sequencing Algorithm
