Dror G. Feitelson
Ahuva W. Mu'alem
Abstract
The conventional model of on-line scheduling postulates that jobs have non-trivial release dates, and are not known in advance. However, it fails to impose any stability constraints, leading to algorithms and analyses that must deal with unrealistic load conditions arising from trivial release dates as a special case. In an effort to make the model more realistic, we show how stability can be expressed as a simple constraint on release times and processing times. We then give empirical and theoretical justifications that such a constraint can close the gap between the theory and practice. As it turns out, this constraint seems to trivialize the scheduling problem.
- A. Batat, Gang Scheduling with Memory Considerations. Master's thesis, Hebrew University, Sep 1999.Google Scholar
- A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson, "Adversarial queuing theory". J. ACM48(1), pp. 13--38, Jan 2001. Google ScholarDigital Library
- C. Chekuri, R. Motwani, B. Natarajan, and C. Stein, "Approximation techniques for average completion time scheduling". In 8th ACM-SIAM Symp. Discrete Algorithms, pp. 609--618, Jan 1997. Google ScholarDigital Library
- D. G. Feitelson, A Survey of Scheduling in Multiprogrammed Parallel Systems. Research Report RC 19790 (87657), IBM T. J. Watson Research Center, Oct 1994.Google Scholar
- D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wong, "Theory and practice in parallel job scheduling". In Job Scheduling Strategies for Parallel Processing, pp. 1--34, Springer Verlag, 1997. Lect. Notes Comput. Sci. vol. 1291. Google ScholarCross Ref
- M. Garey and R. Graham, "Bounds for multiprocessor scheduling with resource constraints". SIAM J. Comput.4(2), pp. 187--200, Jun 1975.Google ScholarDigital Library
- R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling: a survey". In Annals of Discrete Mathematics 5, pp. 287--326, North-Holland, 1979.Google ScholarCross Ref
- L. Kleinrock, Queueing Systems, Vol I: Theory. John Wiley & Sons, 1975. Google ScholarDigital Library
- S. Leonardi and D. Raz, "Approximating total flow time on parallel machines". In 29th Ann. Symp. Theory of Computing, pp. 110--119, 1997. Google ScholarDigital Library
- D. Lifka, "The ANL/IBM SP scheduling system". In Job Scheduling Strategies for Parallel Processing, pp. 295--303, Springer-Verlag, 1995. Lect. Notes Comput. Sci. vol. 949. Google Scholar
- A. Mu'alem and D. G. Feitelson, "Bicriteria scheduling for parallel jobs". In Multidisciplinary Int'l Conf. Scheduling: Theory & Apps. (MISTA), pp. 606--619, Aug 2003.Google Scholar
- D. L. Palumbo, "The derivation and experimental verification of clock synchronization theory". IEEE Trans. Comput.43(6), pp. 676--686, Jun 1994. Google ScholarDigital Library
- J. Sgall, "On-line scheduling --- a survey". In Online Algorithms: The State of the Art, A. Fiat and G. J. Woeginger (eds.), pp. 196--231, Springer-Verlag, 1998. Lect. Notes Comput. Sci. Vol. 1442. Google ScholarDigital Library
Index Terms
- On the definition of "on-line" in job scheduling problems
Recommendations
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion
Flexible job shop scheduling problem.Ensembles of heuristics.Re-scheduling for new job insertion.Multiple objectives scheduling problem. This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job ...
Comments