Scheduling equal processing time jobs to minimize the weighted number of late jobs

DOI10.1007/s10852-005-9011-4zbMath1126.90019OpenAlexW2025422398MaRDI QIDQ853793

Svetlana A. Kravchenko, Peter Brucker

Publication date: 17 November 2006

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-005-9011-4

zbMATH Keywords

complexitynon-preemptivepreemtive

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

New algorithms for minimizing the weighted number of tardy jobs on a single machine ⋮ Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Parameterized multi-scenario single-machine scheduling problems ⋮ Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines ⋮ Parallel machine problems with equal processing times: a survey ⋮ New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria

Cites Work

• Preemptive job-shop scheduling problems with a fixed number of jobs
• Open shop problems with unit time operations
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling equal processing time jobs to minimize the weighted number of late jobs