Skip to main content
SpringerLink
Log in

A Robust Meta-Hyper-Heuristic Approach to Hybrid Flow-Shop Scheduling

  • Chapter
Evolutionary Scheduling

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

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
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • 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.

References

  1. K. R. Baker and G. D. Scudder. Sequencing with earliness and tardiness penal- ties: A review. Operations Research, 38:22-36, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  2. Shaukat A. Brah. Scheduling in a Flow Shop with Multiple Processors. PhD thesis, University of Houston, 1988.

    Google Scholar 

  3. E. Burke and E. Soubeiga. Scheduling nurses using a tabu-search hyperheuristic. In 1st Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2003), 2003.

    Google Scholar 

  4. Edmund Burke, Graham Kendall, Ross O‘Brien, D. Redrup, and E. Soubeiga. An ant algorithm hyper-heuristic. In Proceedings of The Fifth Metaheuristics International Conference (MIC 2003), 2003.

    Google Scholar 

  5. Edmund Burke, Graham Kendall, Dario Landa Silva, Ross O‘Brien, and Eric Soubeiga. An ant algorithm hyperheuristic for the project presentation scheduling problem. In Proceedings of the Congress on Evolutionary Computation (CEC 2005), pages 2263-2270. IEEE press, 2005.

    Google Scholar 

  6. Edmund K. Burke, Graham Kendall, and Eric Soubeiga. A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics, 9:451-470, 2003.

    Article  Google Scholar 

  7. Konstantin Chakhlevitch and Peter Cowling. Choosing the fittest subset of low level heuristics in a hyper-heuristic framework. In G.R. Raidl and J. Got- tlieb, editors, EvoCOP 2005, LNCS 3448, pages 23-33, Berlin Heidelbergh, 2005. Springer-Verlag.

    Google Scholar 

  8. Peter Cowling and Konstantin Chakhlevitch. Hyperheuristics for managing a large collection of low level heuristics to schedule personnel. In Proceedings of Congress on Evolutionary Computation (CEC2003), pages 1214-1221. IEEE, 2003.

    Google Scholar 

  9. Peter Cowling, Graham Kendall, and Limin Han. An investigation of a hyper- heuristic genetic algorithm applied to a trainer scheduling problem. In Proceedings of Congress on Evolutionary Computation (CEC2002), pages 1185-1190. IEEE, 2002.

    Google Scholar 

  10. Peter Cowling, Graham Kendall, and Eric Soubeiga. A hyperheuristic approach to scheduling a sales summit. In E. K. Burke and W. Erben, editors, LNCS 2079, Practice and Theory of Automated Timetabling III : Third International Conference, PATAT 2000, pages 176-190. Springer-Verlag, 2000.

    Google Scholar 

  11. Peter Cowling, Graham Kendall, and Eric Soubeiga. A parameter-free hyper- heuristic for scheduling a sales summit. In Proceedings of 4th Metahuristics International Conference (MIC 2001), pages 127-131, 2001.

    Google Scholar 

  12. Peter Cowling, Graham Kendall, and Eric Soubeiga. Hyperheuristics: A robust optimisation method applied to nurse scheduling. In Proceedings of Parallel Problem Solving from Nature Conference, 7th International Conference, LNCS 2439, pages 851-860. Springer-Verlag, 2002.

    Google Scholar 

  13. Peter Cowling, Graham Kendall, and Eric Soubeiga. Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation. In S. Cagoni, J. Gottlieb, E. Hart, M. Middendorf, and R. Günther, editors, LNCS 2279, Applications of Evolutionary Computing : Proceedings of Evo Workshops 2002, pages 1-10. Springer-Verlag, 2002.

    Google Scholar 

  14. Hsiao-Lan Fang, Peter Ross, and Dave Corne. A promising hybrid GA/Heuristic approach for open-shop scheduling prblems. In A. Cohn, editor, 11th European Conference on Artificial Intelligence (ECAI 94), pages 590-594. John Wiley & Sons, Ltd., 1994.

    Google Scholar 

  15. Rubén Ruíz García and Concepción Maroto. A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine elegibility. European Journal of Operational Research, 169:781-800, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  16. J. N. D. Gupta. Two-stage hybrid flow shop scheduling problem. Operational Research Society, 39:359-364, 1988.

    MATH  Google Scholar 

  17. Limin Han and Graham Kendall. Guided operators for hyper-heuristic genetic algorithm. In Proceedings of The 16th Australian Conference on Artificial In- telligence (AI’03), LNAI 2903, pages 807-820. Springer-Verlag, 2003.

    Google Scholar 

  18. Limin Han and Graham Kendall. An investigation of a tabu assisted hyper- heuristic genetic algorithm. In Proceedings of Congress on Evolutionary Com- putation (CEC2003), pages 2230-2237. IEEE, 2003.

    Google Scholar 

  19. Limin Han, Graham Kendall, and Peter Cowling. An adaptive length chromo- some hyperheuristic genetic algorithm for a trainer scheduling problem. In Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL’02), pages 267-271, 2002.

    Google Scholar 

  20. Emma Hart and Peter Ross. A heuristic combination method for solving job- shop scheduling problems. In Lecture Notes in Computer Sciences (1498), pages 845-854. Springer-Verlag, 1998.

    Google Scholar 

  21. J. A. Hoogeveen, J. K. Lenstra, and B. Veltman. Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. European Journal of Operational Research, 89:172-175, 1996.

    MATH  Google Scholar 

  22. M. E. Kurz, M. Runkle, and S. Pehlivan. Comparing problem-based-search and random keys genetic algorithms for the SDST FFL makespan scheduling problem. working paper, 2005.

    Google Scholar 

  23. Mary E. Kurz and Ronald G. Askin. Scheduling flexible flow lines with sequence dependent set-up times. European Journal of Operational Research, 159:66-82, 2003.

    Google Scholar 

  24. V. Jorge Leon and Balakrishnan Ramamoorthy. An adaptable problem space based search method for flexible flow line scheduling. IIE Transactions, 29:115-125,1997.

    Google Scholar 

  25. Richard Linn and Wei Zhang. Hybrid flow shop scheduling: A survey. Computers & Industrial Engineering, 37:57-61, 1999.

    Article  Google Scholar 

  26. Ceyda Oguz and M. Fikret Ercan. A genetic algorithm for hybrid flow shop scheduling with multiprocessor tasks. Journal of Scheduling, 8:323-351, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  27. Michael Pinedo. Scheduling Theory, Algorithms and Systems. Prentice Hall, 2002.

    Google Scholar 

  28. José Antonio Vázquez Rodríguez and Abdellah Salhi. Performance of single stage representation genetic algorithms in scheduling flexible flow shops. In Congress on Evolutionary Computation (CEC2005), pages 1364-1371. IEEE Press, 2005.

    Google Scholar 

  29. Funda Sivrikaya Serifoglu and Gunduz Ulusoy. Multiprocessor task scheduling in multistage hybrid flow shops: A genetic algorithm approach. Journal of the Operational Research Society, 55:504-512, 2004.

    Article  Google Scholar 

  30. Eric Soubeiga. Development and Application of Hyperheuristics to Personnel Scheduling. PhD thesis, School of Computer Science and Information Technology, The University of Nottingham, 2003.

    Google Scholar 

  31. Hugo Terashima-Marín, Armando Morán-Saavedra, and Peter Ross. Forming hyper-heuristics with GAs when solving 2d-regular cutting stock problems. In Proceedings of Congress on Evolutionary Computation CEC(2005), pages 1104- 1110. IEEE Press, 2005.

    Google Scholar 

  32. A. Vignier, J. C. Billaut, and C. Proust. Les problèmes d’ordonnancement de type flow-shop hybride: état de l’art. Operations Research, 33:117-183, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  33. Hong Wang. Flexible flow shop scheduling: Optimum, heuristics and artifical intelligence solutions. Expert Systems, 22:78-85, 2005.

    Article  Google Scholar 

  34. Bagas Wardono and Yahya Fathi. A tabu search algorithm for the multi-stage parallel machines problem with limited buffer capacities. European Journal of Operational Research, 155:380-401, 2004.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Sciences Department, University of Essex, Wivenhoe Park, Colchester, UK

    José Antonio Vàzquez Rodríguez

  2. Mathematical Sciences Department, University of Essex, Wivenhoe Park, Colchester, UK

    Abdellah Salhi

Authors
  1. José Antonio Vàzquez Rodríguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdellah Salhi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Modeling Optimisation Scheduling and Intelligent Control (MOSAIC), Research Centre, Department of Computing, University of Bradford, West Yorkshire, BD7 1DP, Bradford, UK

    Keshav P. Dahal

  2. Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore, Singapore

    Kay Chen Tan

  3. Modeling Optimisation Scheduling and Intelligent Control (MOSAIC), Research Centre, Department of Computing, University of Bradford, West Yorkshire, BD7 1DP, Bradford, UK

    Peter I. Cowling

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Rodríguez, J.A.V., Salhi, A. (2007). A Robust Meta-Hyper-Heuristic Approach to Hybrid Flow-Shop Scheduling. In: Dahal, K.P., Tan, K.C., Cowling, P.I. (eds) Evolutionary Scheduling. Studies in Computational Intelligence, vol 49. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48584-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48584-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation