Abstract
We consider a single-machine on-line scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on a single machine. Each job becomes available at its release date, which is not known in advance, and its characteristics, i.e., processing requirement and delivery time, become known at its arrival. The objective is to minimize the time by which all jobs have been delivered. In our model preemption is not allowed, but we are allowed to restart a job, that is, the processing of a job can be broken off to have the machine available to process an urgent job, but the time already spent on processing this interrupted job is considered to be lost. We propose an on-line algorithm and show that its performance bound is equal to 1.5, which matches a known lower bound due to Vestjens. For the same problem without restarts the optimal worst-case bound is known to be equal to (\( \sqrt 5 + 1 \) )/2 ≈ 1.61803; this is the first example of a situation in which the possibility of applying restarts reduces the worst-case performance bound, even though the processing times are known.
Research partially supported by CONACyT grant #473100-5-28937A
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Chen, A. Van Vliet, G.J. Woeginger (1994). New lower and upper bounds for on-line scheduling. Operations Research Letters 16, 221–230.
E. Davis AND J.M. Jaffe (1981). Algorithms for scheduling tasks on unrelated processors. Journal of the Association of Computing Machinery 28, 721–736.
R.L. Graham (1966). Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563–1581.
L.A. Hall, A.S. Schulz, D.B. Shmoys, J. Wein (1997). Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research 22, 513–544.
J.A. Hoogeveen, C.N. Potts, AND G.J. Woeginger (1999). On-line scheduling on a single machine: Maximizing the number of early jobs. Report Woe-48, Technical University Graz.
J.A. Hoogeveen AND A.P.A. Vestjens (2000). A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM Journal on Discrete Mathematics 13, 56–63.
H. Kise, T. Ibaraki, H. Mine (1979). Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times. Journal of the Operations Research Society Japan 22, 205–224.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (1993). Sequencing and scheduling: algorithms and complexity. S.C. Graves, P.H. Zipkin, A.H.G. Rinnooy Kan (eds.). Logistics of Production and Inventory; Handbooks in Operations Research and Management Science, Vol. 4, North-Holland, Amsterdam, 445–522.
R. Motwani, S. Phillips, E. Torng (1994). Non-clairvoyant scheduling. Theoretical Computer Science 130, 17–47.
C. Phillips, C. Stein, J. Wein (1998). Minimizing average completion time in the presence of release dates. Mathematical Programming (B)28, 199–223.
S.S. Seiden (1998). Randomized Online Scheduling with Delivery Times, Report Woe-24, Technical University Graz.
J. Sgall (1998). On-line scheduling. A. Fiat, G.J. Woeginger (eds.). On-Line Algorithms: the State of the Art, Lecture Notes in Computer Science 1442, Springer, Berlin, 196–231.
D.B. Shmoys, J. Wein, D.P. Williamson (1995). Scheduling parallel machines on-line. SIAM Journal on Computing 24, 1313–1331.
A.P.A. Vestjens (1997). On-line machine scheduling, PhD Thesis, Eindhoven University of Technology.
G.J. Woeginger (1999). Personal communication.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van den Akker, M., Hoogeveen, H., Vakhania, N. (2000). Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine. In: Paterson, M.S. (eds) Algorithms - ESA 2000. ESA 2000. Lecture Notes in Computer Science, vol 1879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45253-2_39
Download citation
DOI: https://doi.org/10.1007/3-540-45253-2_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41004-1
Online ISBN: 978-3-540-45253-9
eBook Packages: Springer Book Archive