%0 Conference Proceedings
%T Online Scheduling of Unit Length Jobs with Commitment and Penalties
%+ University of Leicester
%A Fung, Stanley, Y.
%Z Part 1: Track A: Algorithms, Complexity and Models of Computation
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 8th IFIP International Conference on Theoretical Computer Science (TCS)
%C Rome, Italy
%Y Josep Diaz
%Y Ivan Lanese
%Y Davide Sangiorgi
%I Springer
%3 Theoretical Computer Science
%V LNCS-8705
%P 54-65
%8 2014-09-01
%D 2014
%R 10.1007/978-3-662-44602-7_5
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z TC 2
%Z WG 2.2
%2 https://inria.hal.science/hal-01402028/document
%2 https://inria.hal.science/hal-01402028/file/978-3-662-44602-7_5_Chapter.pdf
%L hal-01402028
%U https://inria.hal.science/hal-01402028
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC2
%~ IFIP-LNCS-8705
%~ IFIP-TCS
%~ IFIP-WG2-2