Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Applied Parallel Computing

PARA 2000: Applied Parallel Computing. New Paradigms for HPC in Industry and Academia pp 215–222Cite as

A Parallel Implementation of a Job Shop Scheduling Heuristic

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1947))

Abstract

In the paper, we present first experimental results of a parallel implementation for a simulated annealing-based heuristic. The heuristic has been developed for job shop scheduling problems that consist of l jobs where each job has to process exactly one task on each of the m machines. We utilize the disjunctive graph representation and the objective is to minimize the length of longest paths, i.e., the overall completion time of tasks. The heuristic has been implemented in a distributed computing environment. First computational experiments were performed on several benchmark problems using a cluster of 12 processors. We compare our computational experiments to sequential runs and show that stable results equal or close to optimum solutions are calculated by the parallel implementation.

Research partially supported by the HK-Germany Joint Research Scheme under Grant No. D/9800710, and by the RWCP under Grant No. D-00-026.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.H.L. Aarts. Local Search in Combinatorial Optimization. Wiley, NY, 1998.

    Google Scholar 

  2. E.H.L. Aarts and J.H.M. Korst. Simulated Annealing and Boltzmann Machines: A Stochastic Approach. Wiley, NY, 1989.

    Google Scholar 

  3. M. Besch, H. Bi, P. Enskonatus, G. Heber, M. Wilhelmi. High-level Data Parallel Programming in PROMOTER. Proc. Intern. Workshop on High-level Parallel Programming Models and Supportive Environments, pp. 47–54, 1997.

    Google Scholar 

  4. H. Bi, M. Kessler, H. W. Pohl, M. Tief. Promise-High-level Data-parallel Program-ming Environment. Proc. Workshop on Advanced Parallel Processing Technologies, pp. 207–211, Publishing House of Electronic Industry, 1999.

    Google Scholar 

  5. E. Dekel and S. Shani. A Parallel Matching Algorithm for Convex Bibartite Graphs and Applications to Scheduling. Journal of Parallel and Distributed Computing, 1:185–205, 1984.

    Article  Google Scholar 

  6. M.R. Garey and D.S. Johnson. Complexity Results for Multiprocessor Scheduling under Resource Constraints. SIAM Journal on Computing, 4(4):397–411, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  7. Lawrence, S., Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement), Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania, 1984.

    Google Scholar 

  8. J.F. Muth, G.L. Thompson, and P.R. Winters, editors. Industrial Scheduling. Prentice-Hall, Englewood Cliffs, N.J., 1963.

    Google Scholar 

  9. M. Perregaard and J. Clausen. Parallel Branch-and-Bound Methods for the JobShop Scheduling Problem. Annals of Operations Research, 83:137–160, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  10. K. Steinhöfel, A. Albrecht, and C.K. Wong. Two Simulated Annealing-Based Heuristics for the Job Shop Scheduling Problem. European Journal of Operational Research, 118(3):524–548, 1999.

    Article  MATH  Google Scholar 

  11. K. Steinhöfel, A. Albrecht, and C.K. Wong. On Parallel Heuristics for the Job Shop Scheduling Problem. In: S.Q. Zheng, editor, Proc. 11th International Conf. on Parallel and Distributed Computing and Systems, pp. 806–811, MIT, Cambridge, Mass., November 3-6, 1999.

    Google Scholar 

  12. E. Taillard. Parallel Taboo Search Techniques for the Job-Shop Scheduling Problem. ORSA Journal on Computing, 6:108–117, 1994.

    MATH  Google Scholar 

  13. P.J.M. Van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job Shop Scheduling by Simulated Annealing. Operations Research, 40(1):113–125, 1992.

    MATH  MathSciNet  Google Scholar 

  14. M.G.A. Verhoeven, H.M.M. ten Eikelder, B.J.M. Aarts, E.H.L. Aarts. Sequential and Parallel Local Search Algorithms for Job Shop Scheduling. Meta-Heuristics (Advances and Trends in Local Search Paradigms for Optimization), pp. 359–371, 1999.

    Google Scholar 

  15. D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast’janov, and D.B. Shmoys. Short Shop Schedules. Operations Research, 45:288–294, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  16. Yamada, T. and Nakano, R., A Genetic Algorithm Applicable to Large-Scale Job Shop Problems, In: R. Manner and B. Manderick (eds.), Proc. 2nd International Conf. on Parallel Problem Solving from Nature, North-Holland, Amsterdam, 1992, pp. 281–290.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GMD - Research Center for Information Technology, 12489, Berlin, Germany

    U. Der & K. Steinhöfel

  2. ETH Zurich, Institute of Theoretical Computer Science, 8092, Zurich, Switzerland

    K. Steinhöfel

Authors
  1. U. Der
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Steinhöfel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, 5020, Bergen, Norway

    Tor Sørevik , Fredrik Manne  & Assefaw Hadish Gebremedhin ,  & 

  2. Parallab, University of Bergen, 5020, Bergen, Norway

    Randi Moe

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Der, U., Steinhöfel, K. (2001). A Parallel Implementation of a Job Shop Scheduling Heuristic. In: Sørevik, T., Manne, F., Gebremedhin, A.H., Moe, R. (eds) Applied Parallel Computing. New Paradigms for HPC in Industry and Academia. PARA 2000. Lecture Notes in Computer Science, vol 1947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-70734-4_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-70734-4_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41729-3

  • Online ISBN: 978-3-540-70734-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation