OPTIMIZED SCHEDULING IN FLEXIBLE JOB SHOP PROBLEM WITH MAINTENANCE MANAGEMENT USING HYBRID DISCRETE FIREFLY ALGORITHM
Keywords:
Flexible job shop scheduling problem, Hybrid discrete firefly algorithm, multi-objective optimization, Maintenance activity, Local search.Abstract
Most scheduling problems, including the standard Flexible Job Shop Scheduling Problem (FJSP), typically assume that machines remain continuously available throughout the entire planning horizon. While this assumption may be valid in certain scenarios, it often fails to reflect real-world situations where machines may experience downtime due to maintenance, pre-scheduled tasks, or unforeseen disruptions.
References
M. R. Garey, D.S. Johnson and R. Sethi “The complexity of flowshop and jobshop scheduling”. Mathematics of Operations Research, Vol.1, 1976, pp.117-129.
W. J. Xia and Z.M. Wu “An effective hybrid optimization approach for multi-objective flexible job shop scheduling problems”. Computers and Industrial Engineering, Vol.48 No.2, 2005, pp.409-425.
G. Schmidt “Scheduling with limited machine availability”. European Journal of Operational Research, Vol.121, No.1, 2000, pp.1-15.
