Skip to main content

Global and Local Search for Scheduling Job Shop with Parallel Machines

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,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

This work was supported by CONACyT grant #28937A

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-44399-1_8
  • Chapter length: 13 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   109.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-44399-5
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   139.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams J., E. Balas and D. Zawack, “The Shifting Bottleneck Procedure for Job Shop Scheduling”, Management Science, 34, 391–401 (1988).

    MATH  MathSciNet  CrossRef  Google Scholar 

  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. 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).

    MATH  CrossRef  Google Scholar 

  4. Carlier J. and E. Pinson, “An Algorithm for Solving Job Shop Problem”, Management Science, 35, 164–176 (1989).

    MATH  MathSciNet  Google Scholar 

  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).

    MATH  CrossRef  MathSciNet  Google Scholar 

  6. Federgruen A. and H. Groenevelt, “Preemptive scheduling of uniform machines by ordinary network flow techniques”, Management Science 32, 341–349 (1986).

    MATH  MathSciNet  Google Scholar 

  7. Glover F., “Tabu-search: A tutorial”, Interfaces, 20, 74–94 (1990).

    Google Scholar 

  8. Ivens P. and M. Lambrecht, “Extending the shifting bottleneck procedure to real-life applications”, European J. on Operations Research 90, 252–268 (1996).

    MATH  CrossRef  Google Scholar 

  9. Kirkpatrick S, C.D. Gelant and M.P. Vecchi, “Optimization by simulated annealing”, Science, 220, 924–928 (1983)

    Google Scholar 

  10. Lageweg B.J., Lenstra J.K., Rinnooy Kan A.H.G., “Job Shop Scheduling by Implicit Enumeration”, Management Science 24,441–450 (1977).

    MATH  MathSciNet  Google Scholar 

  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).

    MATH  CrossRef  MathSciNet  Google Scholar 

  12. Lawton G., “Generic algorithms for schedule optimization”, AI Expert, May, 23–27 (1992).

    Google Scholar 

  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).

    MATH  Google Scholar 

  14. Morton T.E. and D. Pentico, “Heuristic scheduling systems”, Wiley (1993).

    Google Scholar 

  15. Ow P.S. and T.E. Morton, “Filtered beam search in scheduling”, International J. of Production Research 26, 35–62 (1988).

    CrossRef  Google Scholar 

  16. Schutten J.M.J., “Practical job shop scheduling”, Annals of Operations Research 83, 161–177 (1998).

    MATH  CrossRef  MathSciNet  Google Scholar 

  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. Vakhania N., “Assignment of jobs to parallel computers of different throughput”, Automation and Remote Control 56, 280–286 (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vakhania, N. (2000). Global and Local Search for Scheduling Job Shop with Parallel Machines. In: Monard, M.C., Sichman, J.S. (eds) Advances in Artificial Intelligence. IBERAMIA SBIA 2000 2000. Lecture Notes in Computer Science(), vol 1952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44399-1_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-44399-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41276-2

  • Online ISBN: 978-3-540-44399-5

  • eBook Packages: Springer Book Archive