A Simple Optimality Proof of Moore's Sequencing Algorithm
From MaRDI portal
Cited in
(14)- Scheduling jobs under decreasing linear deterioration
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Scheduling jobs under simple linear deterioration
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- 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
- A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs
- 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
- 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
- Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
- Equitable scheduling on a single machine
- Minimizing the weighted number of tardy jobs on a single machine with release dates
This page was built for publication: A Simple Optimality Proof of Moore's Sequencing Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5613006)
