HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS

DOI10.1142/S0129054194000141zbMath0830.68010OpenAlexW2080665447MaRDI QIDQ4853326

Vincent K. M. Yu, Joseph Y.-T. Leung

Publication date: 29 October 1995

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054194000141

zbMATH Keywords

multiprocessornonpreemptively scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs ⋮ Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms ⋮ Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

This page was built for publication: HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS