Job shop scheduling with unit length tasks
Meike Akveld; Raphael Bernhard
RAIRO - Theoretical Informatics and Applications (2012)
- Volume: 46, Issue: 3, page 329-342
- ISSN: 0988-3754
Access Full Article
topAbstract
topHow to cite
topReferences
top- H.-J. Böckenhauer, D. Komm, R. Královič, R. Královič and T. Mömke, On the advice complexity of online problems, in Proc. of the 20th International Symposium on Algorithms and Computation (ISAAC 2009). Lect. Notes Comput. Sci.5878 (2009) 331–340.
- P. Brucker, An efficient algorithm for the job-shop problem with two jobs. Computing40 (1988) 353–359.
- P. Brucker, Scheduling Algorithms, 4th edition. Springer-Verlag (2004).
- J. Hromkovič, T. Mömke, K. Steinhöfel and P. Widmayer, Job shop scheduling with unit length tasks: bounds and algorithms. Algorithmic Oper. Res.2 (2007) 1–14.
- A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge University Press (1998).
- J. Hromkovič, Design and Analysis of Randomized Algorithms. Springer-Verlag (2006).
- S. Irani and A.R. Karlin, On online computation, in Approximation Algorithms for NP-hard Problems, Chapter 13, edited by Hochbaum. PWS Publishing Company (1997) 521–564.
- D. Komm and R. Kálovič, Advice complexity and barely random algorithms. Theoret. Inform. Appl.45 (2011) 249–267.
- D.D. Sleator and R.E. Tarjan, Amortized efficiency of list update and paging rules. Commun. ACM28 (1985) 202–208.