Skip to main content
SpringerLink
Log in

Scheduling flexible job shop problem subject to machine breakdown with route changing and right-shift strategies

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In this paper, flexible job shop scheduling problem with machine breakdown is of concern. Considering that there is a limitation in improving robust and stable performance of rescheduling with a single strategy, an approach with multi-strategies is proposed to make the scheduling more robust and stable. First, in prescheduling, a new idle time insertion strategy is put forward. In this new policy, idle time equal to repair time is inserted into an appropriate position of each machine according to the machine's breakdown nature. Second, route changing strategy combined with right-shift policy is proposed to keep the rescheduling as stable and robust as possible. In this policy, whether to right shift or route change is dependent on the cost of archiving robustness and stability. Based on the two strategies, new algorithms dealing with idle time insertion, right-shift scheduling, and route changing scheduling are designed. The computational results show the effectiveness of the new strategies and new algorithms compared with other strategies.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Rahmati Seyed Habib A, Zandieh M (2012) A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem. Int J Adv Manuf Technol 58(9–12):1115–1129

    Article  Google Scholar 

  2. Amir R, Saeed M (2011) Dynamic flexible job shop scheduling with alternative process plans: an agent-based approach. Int J Adv Manuf Technol 54(9–12):1091–1107

    Google Scholar 

  3. Moradi E, Fatemi Ghomi SMT, Zandieh M (2010) An efficient architecture for scheduling flexible job-shop with machine availability constraints. Int J Adv Manuf Technol 51(1–4):325–339

    Article  Google Scholar 

  4. Al-Hinai N, ElMekkawy TY (2011) An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem. Flex Serv Manuf J 23(1):64–85

    Article  Google Scholar 

  5. Lei D (2011) Scheduling stochastic job shop subject to random breakdown to minimize makespan. Int J Adv Manuf Technol 55(9–12):1183–1192

    Article  Google Scholar 

  6. Al-Hinai N, ElMekkawy TY (2011) Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. Int J Prod Econ 132(2):279–291

    Article  Google Scholar 

  7. Kamoun H, Sriskandarajah C (1993) The complexity of scheduling jobs in repetitive manufacturing systems. Eur J Oper Res 70(3):350–364

    Article  MATH  Google Scholar 

  8. Kutanoglu E, Sabuncuoglu I (2001) Routing-based reactive scheduling policies for machine failures in dynamic job shops. Int J Prod Res 39(14):3141–3158

    Article  MATH  Google Scholar 

  9. Cowling PI, Johansson M (2002) Using real time information for effective dynamic scheduling. Eur J Oper Res 139(2):230–244

    Article  MathSciNet  MATH  Google Scholar 

  10. Shafaei R, Brunn P (1999) Workshop scheduling using practical (inaccurate) data—part 2: an investigation of the robustness of scheduling rules in a dynamic and stochastic environment. Int J Prod Res 37(18):4105–4117

    Article  MATH  Google Scholar 

  11. Wu SD, Storer RH, Chang PC (1993) One-machine rescheduling heuristics with efficiency and stability as criteria. Comput Oper Res 20(1):1–14

    Article  MATH  Google Scholar 

  12. Goren S, Sabuncuoglu I (2009) Optimization of schedule robustness and stability under random machine breakdowns and processing time variability. IIE Trans 42(3):203–220

    Article  Google Scholar 

  13. Alvarez-Valdes R, Fuertes A, Tamarit JM (2005) A heuristic to schedule flexible job-shop in a glass factory. Eur J Oper Res 165(2):525–534

    Article  MATH  Google Scholar 

  14. Wang S, Yu J (2010) An effective heuristic for flexible job-shop scheduling problem with maintenance activities. Comput Ind Eng 59(3):436–447

    Article  Google Scholar 

  15. Mehta SV, Uzsoy R (1999) Predictable scheduling of a single machine subject to breakdowns. Int J Comput Int Manuf 12(1):15–38

    Article  Google Scholar 

  16. O'Donovan R, Uzsoy R, McKay KN (1999) Predictable scheduling of a single machine with breakdowns and sensitive jobs. Int J Prod Res 37(18):4217–4233

    Article  MATH  Google Scholar 

  17. Fang J, Xi Y (1997) A rolling horizon job shop rescheduling strategy in the dynamic environment. Int J Adv Manuf Technol 13(3):227–232

    Article  Google Scholar 

  18. Mehta SV, Uzsoy RM (1998) Predictable scheduling of a job shop subject to breakdowns. IEEE Trans Robot Aotom 14(3):365–378

    Article  Google Scholar 

  19. Holthaus O (1999) Scheduling in job shops with machine breakdowns and experimental study. Comput Ind Eng 36(1):137–162

    Article  Google Scholar 

  20. Subramaniam V, Raheja AS (2003) mAOR: a heuristic-based reactive repair mechanism for job shop schedules. Int J Adv Manuf Technol 22(9–10):669–680

    Article  Google Scholar 

  21. NA Masruroh, KL Poh (2007) A Bayesian network approach to job-shop rescheduling. International Conference on Industrial Engineering and Engineering Management IEEM : 1098–1102

  22. Yongmei Hu, Fu Yanan, Jia Lei (2007) An algorithm of job shop rolling scheduling based on singular rough sets. Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, Vol 2, Proceedings: 221–225

  23. Suwa HS (2007) Capability of cumulative delay based reactive scheduling for job shops with machine breakdowns. Comput Ind Eng 53(1):63–78

    Article  Google Scholar 

  24. Zandieh M, Adibi MA (2010) Dynamic job shop scheduling using variable neighborhood search. Int J Prod Res 48(8):2449–2458

    Article  MATH  Google Scholar 

  25. Mikkel T. Jensen (2001) Robust and flexible scheduling with evolutionary computation. PhD Dissertation, Department of Computer Science, University of Aarhus, Denmark

  26. Kamrul Hasan SM, Sarker R, Essam D (2011) Genetic algorithm for job-shop scheduling with machine unavailability and breakdowns. Int J Prod Res 49(16):4999–5015

    Article  Google Scholar 

  27. Szelke E, Kerr R (1994) Knowledge-based reactive scheduling. Prod Plan Contr 5(2):124–145

    Article  Google Scholar 

  28. Kacem I, Hammadi S, Borne P (2002) Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cybern 32(1):1–13

    Article  Google Scholar 

  29. Mattfeld DC (1996) Evolutionary search and the job shop: investigations on genetic algorithms for production scheduling. Physica-Verlag, Heidelberg

    Book  MATH  Google Scholar 

  30. A Yahyaoui, N Fnaiech, F Fnaiech (2009) New shifting method for job shop scheduling subject to invariant constraints of resources availability. 35th Annual Conference of IEEE Industrial Electronics: 3211–3216

  31. Kacem I, Hammadi S, Brone P (2002) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math Comput Simul 60(3–5):245–276

    Article  MATH  Google Scholar 

  32. Mesghouni K, Hammadi S, Borne P (1997) Evolution programs for job-shop scheduling. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Orlando, Florida, vol. 1: 720–725

  33. Lee DY, DiCesare F (1994) FMS scheduling flexible manufacturing systems using Petri nets and heuristic search. IEEE Trans Robot Autom 10(2):123–132

    Article  Google Scholar 

  34. Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157–183

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Automation, Chongqing University, Chongqing, 400044, China

    Wei He & Di-hua Sun

  2. Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education, Chongqing, 400044, China

    Wei He & Di-hua Sun

Authors
  1. Wei He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Di-hua Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei He.

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, W., Sun, Dh. Scheduling flexible job shop problem subject to machine breakdown with route changing and right-shift strategies. Int J Adv Manuf Technol 66, 501–514 (2013). https://doi.org/10.1007/s00170-012-4344-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-4344-4

Keywords

Search

Navigation