Skip to main content
SpringerLink
Log in

Hybrid Genetic Algorithm for the Flexible Job-Shop Problem Under Maintenance Constraints

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Included in the following conference series:

Abstract

Most scheduling literature assumes that machines are available at all times. In this paper, we study the flexible Job-shop scheduling problem where the machine maintenance has to be performed within certain intervals and hence the machine becomes unavailable during the maintenance periods. We propose an assignment technique based successively on the use of different priority rules and a local search procedure. An adequate criteria is developed to evaluate the quality of the assignment. The sequencing problem is solved by a hybrid genetic algorithm which takes into account the constraint of availability periods.

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 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Adiri, I., Bruno, J., Frostig, E., Rinnooy Kan, A.H.G.: Single machine flow-time with a single breakdown. Acta Informatica 26, 679–696

    Google Scholar 

  2. Aggoune, R.: Ordonnancement d’Ateliers sous Contraintes de Disponibilité des Machines, Ph.D. Thesis, Université de Metz, France (2002)

    Google Scholar 

  3. Blazewicz, J., Breit, J., Formanowicz, P., Kubiak, W., Schmidt, G.: Heuristic algorithms for the two-machine flowshop problem with limited machine availability. Omega Journal 29, 599–608 (2001)

    Article  Google Scholar 

  4. Jurisch, B.: Scheduling Jobs in Shops with Multi Purpose Machines. Ph.D Thesis, Universität Osnabrück (1992)

    Google Scholar 

  5. Kubiak, W., Blazewicz, J., Formanowicz, P., Breit, J., Schmidt, G.: Two-machine flow shops with limited machine availability. European Journal of Operational Research 136, 528–540 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lee, C.Y.: Machine scheduling with an availability constraint. Journal of Global Optimization 9, 395–416 (1996)

    Article  MATH  Google Scholar 

  7. Glover, F., Laguna, M.: Tabu search. Kluwer Publishers, Boston (1997)

    MATH  Google Scholar 

  8. Lee, C.Y.: Minimizing the mazkespan in two-machine flowshop scheduling with availability constraint. Operations research letters 20, 129–139 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lee, C.Y.: Two-machine flowshop scheduling with availability constraints. European Journal of Operational Research 114, 420–429 (1999)

    Article  MATH  Google Scholar 

  10. Lee, K.M., Yamakawa, T.: A Genetic algorithm for general machine scheduling problems. In: Int. Conf. on Conventional and knowledge-Based Electronics Systems, Australia, vol. 2, pp. 60–66 (1998)

    Google Scholar 

  11. Nowicki, E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job-Shop Problem. Management Science 42(6), 797–813 (1996)

    Article  MATH  Google Scholar 

  12. Schmidt, G.: Scheduling on semi identical processors. Z. Oper. Res. A28, 153–162 (1984)

    Article  Google Scholar 

  13. Schmidt, G.: Scheduling independent tasks with deadlines on semi-identical processors. Journal of Operational research society 39, 271–277 (1988)

    MATH  Google Scholar 

  14. Roy, B., Sussmann, B.: Les problemes d’ordonnancement avec contraintes disjonctives (in French). Technical Report 9 bis, SEMA, Paris (France) (December 1964)

    Google Scholar 

  15. Leon, V.J., Wu, S.D.: On scheduling with ready-times, due-dates and vacations. Naval Research Logistics 39, 53–65 (1992)

    Article  MATH  Google Scholar 

  16. Schmidt, G.: Scheduling with limited machine availability. European Journal of Operational Research 121, 1–15 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Mauguiere, P., Billaut, J.-C., Bouquard, J.-L.: New single machine and job-shop scheduling problems with availability constraints. Journal of Scheduling (2004)

    Google Scholar 

  18. Zribi, N., Kacem, I., EL Kamel, A.: Hierarchical Optimization for the Flexible Job-shops Scheduling Problem. In: INCOM 2004, Brazil, April 5-7 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École Centrale de Lille, Cité scientifique, BP 48, 59651, Villeneuve d’Ascq Cedex, France

    Nozha Zribi & Pierre Borne

Authors
  1. Nozha Zribi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Borne
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University, Block S1, Nanyang Avenue, 639798, Singapore

    Lipo Wang

  2. School of Software, Sun Yat-Sen University, 510275, Guangzhou, China

    Ke Chen

  3. School of Computer Engineering, Nanyang Technological University, BLK N4, 2b-39, Nanyang Avenue, 639798, Singapore

    Yew Soon Ong

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zribi, N., Borne, P. (2005). Hybrid Genetic Algorithm for the Flexible Job-Shop Problem Under Maintenance Constraints. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_31

Download citation

  • DOI: https://doi.org/10.1007/11539902_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation