The optimality of Moore-Hodgson algorithm

zbMATH Open1164.90336MaRDI QIDQ3538656FDOQ3538656

Guochun Tang, Xiaolin Chen, Wenyu Su

Publication date: 24 November 2008

Recommendations

• The optimum with the shortest total processing time of on-time jobs
• Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
• Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
• Minimizing the number of tardy jobs for \(m\) parallel machines
• A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine

zbMATH Keywords

optimalityschedulingMoore-Hodgson algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited In (2)

• Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
• The Big Mother of all Dualities: Möller Algorithm

This page was built for publication: The optimality of Moore-Hodgson algorithm

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