Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times
DOI10.1007/978-1-4614-8588-9_2zbMATH Open1344.90020OpenAlexW1596128MaRDI QIDQ2820105FDOQ2820105
Boris Goldengorin, Mikhail Batsyn, Pavel Sukhov, Panos M. Pardalos
Publication date: 13 September 2016
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-8588-9_2
Recommendations
- scientific article; zbMATH DE number 4191384
- Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs
- Preemptive scheduling of equal-length jobs in polynomial time
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
assignment problemlower boundsingle machine schedulingupper boundrelease datesequal processing timesweighted completion time
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Scheduling equal-length jobs on identical parallel machines
- Title not available (Why is that?)
- A 1. 47-approximation for a preemptive single-machine scheduling problem
- A classification of static scheduling problems
- Title not available (Why is that?)
Cited In (6)
- Single parameter analysis of power of preemption on two and three uniform machines
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
- Title not available (Why is that?)
- Modeling single machine preemptive scheduling problems for computational efficiency
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs
- Title not available (Why is that?)
This page was built for publication: Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820105)
