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

DOI10.1016/S0305-0548(02)00084-9MaRDI QIDQ1422366zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A heuristic for maximizing the number of on-time jobs on two uniform parallel machines
• Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
• Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
• A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
• Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
• Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
• On the complexity of scheduling problems with a fixed number of parallel identical machines

Cites work

• scientific article; zbMATH DE number 89399 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Complexity results for scheduling chains on a single machine
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
• Single machine scheduling to minimize the number of early and tardy jobs

Cited in

(4)

• 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
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• Models and algorithms for energy-efficient scheduling with immediate start of jobs

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

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