A note on reverse scheduling with maximum lateness objective

DOI10.1007/s10951-013-0314-4zbMath1297.90053OpenAlexW1990831559WikidataQ59901063 ScholiaQ59901063MaRDI QIDQ398863

J. Herrera, H. S. Yoon

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/79237/8/LiNgChengYuan.pdf

zbMATH Keywords

maximum latenessreverse scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A faster algorithm for the maximum weighted tardiness problem
• Inverse scheduling with maximum lateness objective
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Reducibility among Combinatorial Problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints