Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs

DOI10.1007/s10479-008-0479-yzbMath1279.90064OpenAlexW2048126803MaRDI QIDQ839781

Mitre C. Dourado, Jayme Luiz Szwarcfiter, Rosiane de Freitas Rodrigues

Publication date: 3 September 2009

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0479-y

zbMATH Keywords

algorithmsparallel machinesgraph theoryscheduling theoryunit time jobstardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling on parallel machines considering job-machine dependency constraints ⋮ Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines ⋮ Unnamed Item ⋮ Scheduling problem with multi-purpose parallel machines

Cites Work

• Unnamed Item
• Scheduling equal processing time jobs to minimize the weighted number of late jobs
• A note on scheduling equal-length jobs to maximize throughput
• How useful are preemptive schedules?
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Complexity results for single-machine problems with positive finish-start time-lags
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems