Minimizing the number of late jobs on unrelated machines

DOI10.1016/0167-6377(91)90032-KMaRDI QIDQ811339zbMATH OpenFDO

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

Publication date 1991

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

Full work available at URL https://doi.org/10.1016/0167-6377(91)90032-K

zbMATH Keywords

due dateindependent jobs with release timesnumber of late jobspreemptive schedulingstrong NP-hardnessunrelated machines

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 89399
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines
• scientific article; zbMATH DE number 1757970
• Complexity of preemptive minsum scheduling on unrelated parallel machines
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs

Cites work

• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• scientific article; zbMATH DE number 3648417 (Why is no real title available?)
• scientific article; zbMATH DE number 3873052 (Why is no real title available?)
• scientific article; zbMATH DE number 3708086 (Why is no real title available?)
• scientific article; zbMATH DE number 89399 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Cited in

(8)

• Minimizing the weighted number of tardy jobs on multiple machines: a review
• scientific article; zbMATH DE number 89399 (Why is no real title available?)
• scientific article; zbMATH DE number 1757970 (Why is no real title available?)
• HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS
• Rejecting jobs to Minimize Load and Maximum Flow-time
• Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
• Exact approaches to late work scheduling on unrelated machines
• Tardy jobs minimization in a dynamic job-shop environment using Double Q-Learning algorithm

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

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