Abstract
In recent years, the necessity of considering uncertainty in scheduling problem is recognized by many scholars and practitioners, but there are still not effective methods to deal with uncertainty. This paper focuses on the flexible job shop scheduling problem (FJSP). Uncertainties in FJSP includes many aspects, such as the urgently arrival jobs, the uncertain working condition of the machines, etc. In this paper, we propose an inserting algorithm (IA), which can be used to treat the necessary machine maintenance for reducing unavailability of machines. We use the condition based maintenance (CBM) to reduce unavailability of machines. A problem focused in this paper is the flexible job shop scheduling problem with preventive maintenance (FJSPPM). An inserting algorithm (IA) is utilized to add PM into a preschedule scheme of FJSP which is obtained through an evolutional algorithm. Furthermore, a new better solution for an instance in benchmark of FJSP is obtained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and job shop scheduling. Math Oper Res 1(2):117–129
Hussain MF, Joshi SB (1998) A genetic algorithm for job shop scheduling problems with alternate routing. In: Systems, Man, and Cybernetics, 1998 I.E. international conference, vol 3, pp 2225–2230
Michael Neale and Associates and Great Britain (1979) Committee for terotechnology: a guide to the condition monitoring of machinery. H.M. Stationery Off, London, pp 89–96
Najid NM, Dauzere-Peres S, Zaidat A (2002) A modified simulated annealing method for flexible job shop scheduling problem. In: Systems, Man and Cybernetics, 2002 I.E. international conference, vol 5, pp 6–15
Nasr N, Elsayed EA (1990) Job shop scheduling with alternative machines. Int J Prod Res 28:1595–1609
Thomalla CS (2001) Job shop scheduling with alternative process plans. Int J Prod Econ 74:125–134
Wang L, Zhou G, Xu Y, Wang S, Liu M (2012) An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int J Adv Manuf Technol 60(1–4):303–315
Xia W, Wu Z (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48:409–425
Zheng Y (2012) Supply chain management under availability & uncertainty constraints. Ecole Centrale de Lille, Lille, p 136
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, Y., Lian, L., Fu, Z., Mesghouni, K. (2015). Evolutional Algorithm in Solving Flexible Job Shop Scheduling Problem with Uncertainties. In: Zhang, R., Zhang, Z., Liu, K., Zhang, J. (eds) LISS 2013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40660-7_151
Download citation
DOI: https://doi.org/10.1007/978-3-642-40660-7_151
Published:
Publisher Name: Springer, Berlin, Heidelberg
Online ISBN: 978-3-642-40660-7
eBook Packages: Business and EconomicsBusiness and Management (R0)