Scheduling equal processing time jobs to minimize the weighted number of late jobs
DOI10.1007/S10852-005-9011-4zbMATH Open1126.90019OpenAlexW2025422398MaRDI QIDQ853793FDOQ853793
Authors: 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
Recommendations
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
- Preemptive scheduling of equal-length jobs in polynomial time
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)
Cites Work
Cited In (11)
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- 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
- Time-of-use scheduling problem with equal-length jobs
- Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Scheduling jobs of equal length: complexity, facets and computational results
- Parallel machine problems with equal processing times: a survey
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
- Parameterized multi-scenario single-machine scheduling problems
This page was built for publication: Scheduling equal processing time jobs to minimize the weighted number of late jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853793)
