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

Mikhail Batsyn,Pavel Sukhov,Boris Goldengorin,Panos M Pardalos

doi:10.1007/978-1-4614-8588-9_2

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

Mikhail Batsyn, Pavel Sukhov + Show 2 more

https://doi.org/10.1007/978-1-4614-8588-9_2

Copy DOI

Publication Date: Jan 1, 2013

Citations: 12

Affiliation: National Research University Higher School of Economics, Applied Optimization (United States), University of Florida

#Equal Processing Times #Arbitrary Release Dates + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

AbstractThe preemptive single machine scheduling problem of minimizing the total weighted completion time with equal processing times and arbitrary release dates is one of the four single machine scheduling problems with an open computational complexity status. In this chapter we present lower and upper bounds for the exact solution of this problem based on the assignment problem. We also investigate properties of these bounds and worst-case behavior.KeywordsSingle machine schedulingLower boundUpper boundAssignment problemWeighted completion timeEqual processing timesRelease dates

Full Text