Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems | SpringerLink
Skip to main content
Springer Nature Link
Log in

Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems

  • Chapter
Metaheuristics for Scheduling in Industrial and Manufacturing Applications

Part of the book series: Studies in Computational Intelligence ((SCI,volume 128))

  • 1360 Accesses

Summary

We address the Identical Parallel Machine Scheduling Problem, one of the most important basic problems in scheduling theory, and some generalizations of it arising from real world situations. We survey the current state of the art for the most performing meta-heuristic algorithms for this class of problems, with special emphasis on recent results obtained through Scatter Search. We present insights in the development of this heuristic technique, and discuss the combinatorial difficulties of the problems through the analysis of extensive computational results.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 17159
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 21449
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
JPY 21449
Price includes VAT (Japan)
  • Durable hardcover 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.

Similar content being viewed by others

References

  1. A.C.F. Alvim and C.C. Ribeiro. A hybrid bin-packing heuristic to multiprocessor scheduling. In C.C. Ribeiro and S.L. Martins, editors, Lecture Notes in Computer Science, volume 3059, pages 1–13. Springer-Verlag, Berlin, 2004.

    Google Scholar 

  2. L. Babel, H. Kellerer, and V. Kotov. The k-partitioning problem. Mathematical Methods of Operations Research, 47:59–82, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. Brucker. Scheduling Algorithms. Springer-Verlag, New York, 2001.

    MATH  Google Scholar 

  4. S. Cahon, N. Melab, and E.-G. Talbi. Paradiseo: A framework for the reusable design of parallel and distributed meta-heuristics. Journal of Heuristics, 10(3):357–380, 2004.

    Article  Google Scholar 

  5. B. Chen. Parallel scheduling for early completion. In J.Y.T. Leung, editor, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, chapter 9, pages 175–184. CRC Press, Boca Raton, FL, 2004.

    Google Scholar 

  6. E.G. Coffman, M.R. Garey, and D.S. Johnson. An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing, 7:1–17, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  7. E.G. Coffman, G.S. Lueker, and A.H.G. Rinnooy Kan. Asymptotic methods in the probabilistic analysis of sequencing and packing heuristics. Management Science, 34:266–290, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Dell’Amico, M. Iori, and S. Martello. Heuristic algorithms and scatter search for the cardinality constrained P||C max problem. Journal of Heuristics, 10: 169–204, 2004.

    Article  Google Scholar 

  9. M. Dell’Amico, M. Iori, S. Martello, and M. Monaci. Lower bounds and heuristic algorithms for the k i -partitioning problem. European Journal of Operational Research, 171:725–742, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. Dell’Amico, M. Iori, S. Martello, and M. Monaci. Heuristic and exact algorithms for the identical parallel machine scheduling problem. INFORMS Journal on Computing, 2007 (to appear).

    Google Scholar 

  11. M. Dell’Amico and S. Martello. Optimal scheduling of tasks on identical parallel processors. ORSA Journal on Computing, 7:191–200, 1995.

    MATH  Google Scholar 

  12. M. Dell’Amico and S. Martello. Bounds for the cardinality constrained P||C max problem. Journal of Scheduling, 4:123–138, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Dell’Amico and S. Martello. A note on exact algorithms for the identical parallel machine scheduling problem. European Journal of Operational Research, 160:576–578, 2005.

    Article  MathSciNet  Google Scholar 

  14. R. Martí (ed.). Feature Cluster on Scatter Search Methods for Optimization. EuropeanJournalofOperationalResearch, 169, 2, 2006.

    Google Scholar 

  15. G. Felinskas. An investigation of heuristic methods and application to optimization of resource constrained project schedules. PhD thesis, Vytautas Magnus University, Vilnius, Lithuania, 2007.

    Google Scholar 

  16. P.M. França, M. Gendreau, G. Laporte, and F.M. Müller. A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Computers & Operations Research, 21:205–210, 1994.

    Article  MATH  Google Scholar 

  17. A. Frangioni, E. Necciari, and M. G. Scutellà. A multi-exchange neighborhood for minimum makespan machine scheduling problems. Journal of Combinatorial Optimization, 8:195–220, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  18. F. Glover. Heuristic for integer programming using surrogate constraints. Decision Sciences, 8:156–166, 1977.

    Article  Google Scholar 

  19. F. Glover. A template for scatter search and path relinking. In J. K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, editors, Lecture Notes in Computer Science, volume 1363, pages 1–45. Springer-Verlag, 1998.

    Google Scholar 

  20. F. Glover, M. Laguna, and R. Martí. Scatter search and path relinking: Foundations and advanced designs. In G. C. Onwubolu and B. V. Babu, editors, New Optimization Techniques in Engineering. Springer-Verlag, Heidelberg, 2004.

    Google Scholar 

  21. R.L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563–1581, 1966.

    Google Scholar 

  22. R.L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17:416–429, 1969.

    Article  MATH  MathSciNet  Google Scholar 

  23. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287–326, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  24. M. Haouari, A. Gharbi, and M. Jemmali. Tight bounds for the identical parallel machine scheduling problem. International Transactions in Operational Research, 13:529–548, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  25. M. S. Hillier and M. L. Brandeau. Optimal component assignment and board grouping in printed circuit board manufacturing. Operations Research, 46(5):675–689, 1998.

    Article  MATH  Google Scholar 

  26. D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: practical and theoretical results. Journal of ACM, 34: 144–162, 1987.

    Article  MathSciNet  Google Scholar 

  27. J.Y.T. Leung (ed.). Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton, FL, 2004.

    MATH  Google Scholar 

  28. R. Martí, M. Laguna, and F. Glover. Principles of scatter search. European Journal of Operational Research, 169:359–372, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  29. E. Mokotoff. Parallel machine scheduling problems: a survey. Asia-Pacific Journal of Operational Research, 18:193–242, 2001.

    MATH  MathSciNet  Google Scholar 

  30. E. Mokotoff. An exact algorithm for the identical parallel machine scheduling problem. European Journal of Operational Research, 152:758–769, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  31. E. Mokotoff, J. J. Jimeno, and I. Gutiérrez. List scheduling algorithms to minimize the makespan on identical parallel machines. TOP, 9:243–269, 2001.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DISMI, Università di Modena e Reggio Emilia, Italy

    Manuel Iori

  2. DEIS, Università di Bologna, Italy

    Silvano Martello

Authors
  1. Manuel Iori
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Silvano Martello
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Languages and Informatics Systems, Polytechnic University of Catalonia, Campus Nord, Ed. Omega C/Jordi Girona 1-3, 08034, Barcelona, Spain

    Fatos Xhafa

  2. Norwegian Center of Excellence Center of Excellence for Quantifiable Quality of Service, Norwegian University of Science and Technology, O.S. Bragstads plass 2E, NO-7491, Trondheim, Norway

    Ajith Abraham

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Iori, M., Martello, S. (2008). Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems. In: Xhafa, F., Abraham, A. (eds) Metaheuristics for Scheduling in Industrial and Manufacturing Applications. Studies in Computational Intelligence, vol 128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78985-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78985-7_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78984-0

  • Online ISBN: 978-3-540-78985-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation