Global and Local Search for Scheduling Job Shop with Parallel Machines

  • Nodari Vakhania
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1952)

Abstract

Classical Job Shop Scheduling problem describes operation in several industries. In this classical model, there is only one machine available for each group of tasks, and the precedence relations between the tasks are restricted to serial-parallel. Here we suggest a generaliza- tion, which allows parallel unrelated machines and arbitrary precedence relations between the tasks. The feasible solution space of the generali- zed problem (which is significantly larger than that of a corresponding version without parallel machines) is efficiently reduced to an essenti- ally smaller subset. The use of this reduced subset, instead of the whole feasible set, is beneficial. We propose global and local search algorithms which start from the reduced solution set.

Key words

scheduling job shop parallel machines search tree global and local search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Adams J., E. Balas and D. Zawack, “The Shifting Bottleneck Procedure for Job Shop Scheduling”, Management Science, 34, 391–401 (1988).MATHMathSciNetCrossRefGoogle Scholar
  2. [2]
    Balas E. and A. Wazacopoulos, “Guided Local Search with Shifting Bottleneck for Job Shop Scheduling”, Management Science Research Report MSRR-609, Carnegie-Mellon University (1994).Google Scholar
  3. [3]
    Blazewicz J, W. Domschke and E. Pesch, “The job shop scheduling problem: Conventional and new solution techniques”, Eurorean J. Operations Research 93, 1–33 (1996).MATHCrossRefGoogle Scholar
  4. [4]
    Carlier J. and E. Pinson, “An Algorithm for Solving Job Shop Problem”, Management Science, 35, 164–176 (1989).MATHMathSciNetGoogle Scholar
  5. [5]
    Carlier J. and E. Pinson, “Jakson’s pseudo preemptive schedule for the Pm=r i; q i=C max problem”, Annals of Operations Research 83, 41–58 (1998).MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    Federgruen A. and H. Groenevelt, “Preemptive scheduling of uniform machines by ordinary network flow techniques”, Management Science 32, 341–349 (1986).MATHMathSciNetGoogle Scholar
  7. [7]
    Glover F., “Tabu-search: A tutorial”, Interfaces, 20, 74–94 (1990).Google Scholar
  8. [8]
    Ivens P. and M. Lambrecht, “Extending the shifting bottleneck procedure to real-life applications”, European J. on Operations Research 90, 252–268 (1996).MATHCrossRefGoogle Scholar
  9. [9]
    Kirkpatrick S, C.D. Gelant and M.P. Vecchi, “Optimization by simulated annealing”, Science, 220, 924–928 (1983)Google Scholar
  10. [10]
    Lageweg B.J., Lenstra J.K., Rinnooy Kan A.H.G., “Job Shop Scheduling by Implicit Enumeration”, Management Science 24,441–450 (1977).MATHMathSciNetGoogle Scholar
  11. [11]
    Lawler E.L. and J. Labetoulle, “On preemptive scheduling of unrelated parallel processors by linear programming”, J. of the ACM 25, 612–619 (1978).MATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    Lawton G., “Generic algorithms for schedule optimization”, AI Expert, May, 23–27 (1992).Google Scholar
  13. [13]
    McMahon G.B. and M. Florian, “On scheduling with ready times and due dates to minimize maximum lateness”, Operations Research 23, 475–482 (1975).MATHGoogle Scholar
  14. [14]
    Morton T.E. and D. Pentico, “Heuristic scheduling systems”, Wiley (1993).Google Scholar
  15. [15]
    Ow P.S. and T.E. Morton, “Filtered beam search in scheduling”, International J. of Production Research 26, 35–62 (1988).CrossRefGoogle Scholar
  16. [16]
    Schutten J.M.J., “Practical job shop scheduling”, Annals of Operations Research 83, 161–177 (1998).MATHCrossRefMathSciNetGoogle Scholar
  17. [17]
    Vakhania N., “The Construction of the Reduced Solution Tree for the Job Shop Scheduling Problem”, Discrete Mathematics 2,10–20 (1990).Google Scholar
  18. [18]
    Vakhania N., “Assignment of jobs to parallel computers of different throughput”, Automation and Remote Control 56, 280–286 (1995).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Nodari Vakhania
    • 1
  1. 1.Facultad de CienciasUniversidad Autónoma del Estado de MorelosCuernavacaMexico

Personalised recommendations