Skip to main content
SpringerLink
Log in

Metaheuristics for Group Shop Scheduling

  • Conference paper
  • First Online:
Book cover Parallel Problem Solving from Nature — PPSN VII (PPSN 2002)

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

Included in the following conference series:

Abstract

The Group Shop Scheduling Problem (GSP) is a generalization of the classical Job Shop and Open Shop Scheduling Problems. In the GSP there are m machines and n jobs. Each job consists of a set of operations, which must be processed on specified machines without preemption. The operations of each job are partitioned into groups on which a total precedence order is given. The problem is to order the operations on the machines and on the groups such that the maximal completion time (makespan) of all operations is minimized. The main goal of this paper is to provide a fair comparison of five metaheuristic approaches (i.e., Ant Colony Optimization, Evolutionary Algorithm, Iterated Local Search, Simulated Annealing, and Tabu Search) to tackle the GSP. We guarantee a fair comparison by a common definition of neighborhood in the search space, by using the same data structure, programming language and compiler, and by running the algorithms on the same hardware.

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

Access this chapter

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. H. L. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester, 1997.

    Google Scholar 

  2. J. Błażewicz, W. Domschke, and E. Pesch. The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 93:1–33, 1996.

    Article  MATH  Google Scholar 

  3. C. Blum. ACO applied to Group Shop Scheduling: A case study on Intensification and Diversification. In Proceedings of the 3rd International Workshop on Ant Algorithms (ANTS 2002) (to appear), 2002. Also available as technical report TR/IRIDIA/2002-08, IRIDIA, Université Libre de Bruxelles.

    Google Scholar 

  4. C. Blum, A. Roli, and M. Dorigo. HC-ACO: The hyper-cube framework for Ant Colony Optimization. In Proceedings of the 4th Meta-heuristics International Conference (MIC 2001), volume 2, pages 399–403, 2001.

    Google Scholar 

  5. C. Blum and M. Sampels. Ant colony optimization for FOP shop scheduling: A case study on different pheromone representations. In Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), volume 2, pages 1558–1563, 2002.

    Google Scholar 

  6. P. Brucker, B. Jurisch, and B. Sievers. A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49:107–127, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Carlier and E. Pinson. An algorithm for solving the job-shop problem. Management Science, pages 164–176, 1989.

    Google Scholar 

  8. M. Dorigo and G. Di Caro. The Ant Colony Optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization. McGraw-Hill, 1999.

    Google Scholar 

  9. H. Fisher and G. L. Thompson. Probabilistic learning combinations of local jobshop scheduling rules. In J. F. Muth and G. L. Thompson, editors, Industrial Scheduling. Prentice-Hall, Englewood Cliffs, NJ, 1963.

    Google Scholar 

  10. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Boston et al., 1998.

    Google Scholar 

  11. T. Gonzalez and S. Sahni. Open shop scheduling to minimize finish time. Journal of the ACM, 23(4):665–679, Oct. 1976.

    Article  MATH  MathSciNet  Google Scholar 

  12. J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343–362, 1977.

    Article  MathSciNet  Google Scholar 

  13. E. Nowicki and C. Smutnicki. A fast taboo search algorithm for the job shop problem. Management Science, 42(6):797–813, June 1996.

    Article  MATH  Google Scholar 

  14. M. Sampels, C. Blum, M. Mastrolilli, and O. Rossi-Doria. Metaheuristics for Group Shop scheduling. Technical Report TR/IRIDIA/2002-07, IRIDIA, Université Libre de Bruxelles, 2002.

    Google Scholar 

  15. T. Stützle. Local Search Algorithms for Combinatorial Problems-Analysis, Improvements, and New Applications. PhD thesis, TU Darmstadt, Germany, 1998.

    Google Scholar 

  16. E. Taillard. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64:278–285, 1993.

    Article  MATH  Google Scholar 

  17. S. P. Wright. Adjusted p-values and simultaneous inference. Biometrics, 48:1005–1013, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIDIA, Université Libre de Bruxelles, CP 194/6 Av. Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels & Christian Blum

  2. IDSIA, Galleria 2, 6928, Manno, Switzerland

    Monaldo Mastrolilli

  3. School of Computing, Napier University, 10 Colinton Road, EH10 5DT, Edinburgh, Scotland

    Olivia Rossi-Doria

Authors
  1. Michael Sampels
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Blum
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Monaldo Mastrolilli
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Olivia Rossi-Doria
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Escuela Técnica Superior de Ingeniería Informática, 18071, Granada, Spain

    Juan Julián Merelo Guervós

  2. Department of Informatics, Technological Educational Institute of Thessaloniki, 54101, Thessaloniki, Greece

    Panagiotis Adamidis

  3. Department of Informatics XI, University of Dortmund, 44221, Dortmund, Germany

    Hans-Georg Beyer  & Hans-Paul Schwefel  & 

  4. Department of Signal Theory and Communications, Universidad Carlos III, Madrid, Spain

    José-Luis Fernández-Villacañas

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sampels, M., Blum, C., Mastrolilli, M., Rossi-Doria, O. (2002). Metaheuristics for Group Shop Scheduling. In: Guervós, J.J.M., Adamidis, P., Beyer, HG., Schwefel, HP., Fernández-Villacañas, JL. (eds) Parallel Problem Solving from Nature — PPSN VII. PPSN 2002. Lecture Notes in Computer Science, vol 2439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45712-7_61

Download citation

  • DOI: https://doi.org/10.1007/3-540-45712-7_61

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44139-7

  • Online ISBN: 978-3-540-45712-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation