Minimizing the number of late jobs on unrelated machines

DOI10.1016/0167-6377(91)90032-KzbMath0734.90042MaRDI QIDQ811339

Joseph Y.-T. Leung, Jian-Zhong Du

Publication date: 1991

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

zbMATH Keywords

due datepreemptive schedulingstrong NP-hardnessunrelated machinesindependent jobs with release timesnumber of late jobs

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Online Throughput Maximization on Unrelated Machines: Commitment is No Burden

Cites Work

• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing the number of late jobs on unrelated machines