Annals of Operations Research

, Volume 83, Issue 0, pp 41–58 | Cite as

Jackson's Pseudo Preemptive Schedule for the Pm/ri, qi/Cmax scheduling problem

  • J. Carlier
  • E. Pinson
Article

Abstract

The aim of this paper is to introduce Jackson's Pseudo Preemptive Schedule (JPPS) for the m parallel and identical processor scheduling problem Pm/ri, qi/Cmax. JPPS generalizes Jackson's Preemptive Schedule (JPS) which was introduced for the one-processor sequencing problem 1/ri, qi/Cmax. JPS can be computed in O(nlog n) time and plays a central role in solving NP-hard disjunctive scheduling problems such as the job shop problem. The make-span of JPPS can be computed in O(nlog n + nmlog m) time, and is a tight lower bound for the Pm/ri, qi/Cmax. So JPPS could also play a central role in solving the Resource Constrained Project Scheduling Problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Science 34(1988)39–401.Google Scholar
  2. [2]
    J.R. Barker and G.B. McMahon, Scheduling the general job shop, Management Science 31(1985)594–598.Google Scholar
  3. [3]
    E. Balas, Machine sequencing via disjunctive graphs: An implicit enumeration algorithm, Operations Research 17(1969)941–957.Google Scholar
  4. [4]
    J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer, 1996.Google Scholar
  5. [5]
    P. Brucker, B. Jurisch and B. Sievers, A branch and bound algorithm for the job-shop scheduling problem, Discrete Applied Mathematics 49(1994)109–127.CrossRefGoogle Scholar
  6. [6]
    P. Brucker, B. Jurisch and A. Krämer, The job-shop and immediate selection, Annals of Operations Research 50(1992)93–114.Google Scholar
  7. [7]
    P. Brucker, Scheduling Algorithms, Springer, 1995.Google Scholar
  8. [8]
    J. Carlier, The one-machine sequencing problem, European Journal of Operational Research 11 (1982)42–47.CrossRefGoogle Scholar
  9. [9]
    J. Carlier, Problèmes d'ordonnancements à contraintes de ressources: algorithmes et complexité, Thèse d'état, Université Paris VI, 1984.Google Scholar
  10. [10]
    J. Carlier, Scheduling jobs with release dates and tails on identical machines to minimize makespan, European Journal of Operational Research 29(1987)298–306.CrossRefGoogle Scholar
  11. [11]
    J. Carlier and E. Pinson, An algorithm for solving the job shop problem, Management Science 35(1989)164–176.CrossRefGoogle Scholar
  12. [12]
    J. Carlier and E. Pinson, A practical use of Jackson's preemptive schedule for solving the job-shop problem, Annals of Operations Research 26(1991)269–287.Google Scholar
  13. [13]
    J. Carlier and B. Latapie, Une méthode arborescente pour résoudre les problèmes cumulatifs, RAIRO 25(3)(1991)311–340.Google Scholar
  14. [14]
    J. Carlier and E. Pinson (1993), Adjusting heads and tails for the job-shop problem, European Journal of Operational Research 78(1993)146–161.CrossRefGoogle Scholar
  15. [15]
    E.G. Coffman and R.R. Muntz (1970), Preemptive scheduling on two-processor systems, IEEE Transactions on Computing C-18(1970)1014–1020.Google Scholar
  16. [16]
    E. Demeulemeester and W. Herroelen, Recent advances in branch and bound procedures for Resource-constrained Project Scheduling Problems, in: Scheduling Theory and its Applications, eds. P. Chretienne et al., Wiley, 1995.Google Scholar
  17. [17]
    E. Demeulemeester and W. Herroelen, A branch and bound procedure for the multiple Resourceconstrained Project Scheduling Problem, Management Science 38(1992)1803–1818.Google Scholar
  18. [18]
    S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop, Wiley, Chichester, 1982.Google Scholar
  19. [19]
    M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.Google Scholar
  20. [20]
    A.V. Goldberg and R.E. Tarjan, A new approach to the maximum flow problem, J. ACM 35(1988)921–940.CrossRefGoogle Scholar
  21. [21]
    W. Horn, Some simple scheduling algorithms, Naval. Res. Logis. Quart. 21(1974)177–185.Google Scholar
  22. [22]
    H. Hoogeven, C. Hurkens, J.K. Lenstra and A. Vandevelde, Lower bounds for the multiprocessor flow shop, 2nd Workshop on Models and Algorithms for Planning and Scheduling, Wernigerode, May 22–26, 1995.Google Scholar
  23. [23]
    J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project, University of California. Los Angeles, 1955.Google Scholar
  24. [24]
    J. Labetoulle, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in: Progress in Combinatorial Optimization, Academic Press, FL, 1984, pp. 245–261.Google Scholar
  25. [25]
    B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan, Minimizing maximum lateness on one machine: Computational experience and some applications, Statistica Neerlandica 30(1976)25–41.Google Scholar
  26. [26]
    J.K. Lenstra, A.H.G. Rinnooy Kan and P. Brucker, Complexity of machine scheduling problems, Annals of Discrete Mathematics 1(1977)343–362.CrossRefGoogle Scholar
  27. [27]
    J.K. Lenstra and A.H.G. Rinnooy Kan, Computational complexity of discrete optimization problems, Annals of Discrete Mathematics 4(1979)121–140.Google Scholar
  28. [28]
    Z. Liu and E. Sanlaville, Profile scheduling by list algorithms, in: Scheduling Theory and its Applications, eds., P. Chretienne et al., Wiley, 1995.Google Scholar
  29. [29]
    M. Pinedo, Scheduling Theory, Algorithms and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995.Google Scholar
  30. [30]
    E. Pinson, The job shop scheduling problem: A concise survey and recent developments, in: Scheduling Theory and its Applications, eds. P. Chretienne et al., Wiley, 1995.Google Scholar
  31. [31]
    E. Sanlaville, Conception et analyse d'algorithmes de liste en ordonnancement préemptif, Ph.D. Thesis, Paris VI, 1992.Google Scholar
  32. [32]
    A. Vandevelde, Minimizing the makespan in a multiprocessor flowshop, Master's Thesis, Eindhoven University of Technology, 1994.Google Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • J. Carlier
  • E. Pinson

There are no affiliations available

Personalised recommendations