Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times

DOI10.1007/978-1-4614-8588-9_2zbMath1344.90020OpenAlexW1596128MaRDI QIDQ2820105

Mikhail Batsyn, Pavel Sukhov, Boris I. Goldengorin, 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

zbMATH Keywords

upper boundlower boundrelease datessingle machine schedulingassignment problemequal processing timesweighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

An exact algorithm for the preemptive single machine scheduling of equal-length jobs ⋮ Modeling single machine preemptive scheduling problems for computational efficiency

Cites Work

• Scheduling jobs with equal processing times and time windows on identical parallel machines
• Scheduling equal-length jobs on identical parallel machines
• A 1. 47-approximation for a preemptive single-machine scheduling problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times