A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs

DOI10.1016/j.orl.2021.09.005OpenAlexW3202232747MaRDI QIDQ2670439

R. Ravi, Joseph Cheriyan

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.06210

zbMATH Keywords

scheduling theorynumber of late jobsMoore-Hodgson algorithm

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
• A Simple Optimality Proof of Moore's Sequencing Algorithm
• Scheduling

This page was built for publication: A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs