A note on the maximum number of on-time jobs on parallel identical machines.

DOI10.1016/S0305-0548(02)00084-9zbMath1039.90016OpenAlexW2017215554MaRDI QIDQ1422366

Avital Lann, Gur Mosheiov

Publication date: 14 February 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00084-9

zbMATH Keywords

SchedulingEarliness-tardiness costParallel identical machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Models and algorithms for energy-efficient scheduling with immediate start of jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity results for scheduling chains on a single machine
• Single machine scheduling to minimize the number of early and tardy jobs
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: A note on the maximum number of on-time jobs on parallel identical machines.