Skip to Main content Skip to Navigation
Conference papers

Online Scheduling of Unit Length Jobs with Commitment and Penalties

Abstract : We consider the online scheduling of unit length jobs with two models of commitment. In immediate notification, the acceptance of a job must be decided as soon as it is released. In immediate decision, the actual time slot allocated to the job must also be fixed at the job’s arrival as well. Failure to honour a commitment will result in a penalty. The non-commitment version has been extensively studied. In this paper we give algorithms and lower bounds for the two models of commitment. For immediate decision, we give an O(m(1 + ρ)1/m)-competitive algorithm where m is the number of machines and ρ is the penalty factor, and when m is large we give an O(log(1 + ρ)) upper bound. This is matched by a lower bound of Ω(logρ) on the competitive ratio. For immediate notification we give a lower bound of Ω(logρ/loglogρ). We also give some better bounds when m = 1 or when ρ is small. Finally we give considerations to the case of separate arrival and start times.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, November 24, 2016 - 10:48:12 AM
Last modification on : Thursday, November 24, 2016 - 11:14:11 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 12:31:08 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Stanley y. Fung. Online Scheduling of Unit Length Jobs with Commitment and Penalties. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.54-65, ⟨10.1007/978-3-662-44602-7_5⟩. ⟨hal-01402028⟩



Record views


Files downloads