A Hybrid Algorithm for Flow Shop Scheduling Problem with Unavailable Time Periods and Additional Resources
Author:
ÖZÇELİK Feriştah1ORCID, SARAÇ Tuğba1ORCID
Affiliation:
1. ESKİŞEHİR OSMANGAZİ ÜNİVERSİTESİ
Abstract
In the scheduling literature, the studies that consider unavailable periods (UPs) have generally ignored the resources. However, when the resources to be used in unavailable periods are limited and these resources are needed for more than one machine at the same time, the problem of when the resource should be allocated to which machine arises. This decision is important as it can greatly affect the effectiveness of the machine schedule. For this reason, it is necessary to consider not only the UPs, but also the resources used by the UPs. In this study, flow shop scheduling problem with unavailable periods, flexible in a time window, and additional resources is discussed. In the considered problem, since additional resources are required during the unavailable periods and they can serve just one machine at a time, they cannot overlap. A MIP model and a hybrid algorithm that genetic algorithm and modified subgradient algorithm works together, have been developed for the considered problem. The performance of the hybrid algorithm is compared with pure genetic algorithm and Cplex solver of GAMS by using randomly generated test problems. Test results showed that while hybrid algorithm has solution quality advantage, genetic algorithm has solution time advantage. In addition, with the developed hybrid algorithm, GAMS results were improved up to 88%.
Publisher
Gazi University Journal of Science
Subject
Multidisciplinary,General Engineering
Reference29 articles.
1. [1] Geurtsen, M., Didden, J.B.H.C., Adan, J., Atan, Z., Adan, I., “Production, maintenance and resource scheduling: A review”, European Journal of Operational Research, (2022) (In press). 2. [2] Lee, C., Chen, Z., “Scheduling jobs and maintenance activities on parallel machines”, Naval Research Logistics, 47: 145–165, (2000). 3. [3] Yoo, J., Lee, I., “Parallel machine scheduling with maintenance activities”, Computers & Industrial Engineering, 101: 361–371, (2016). 4. [4] Belkaid, F., Dahane, M., Sair, Z., Khatab, A., “Efficient approach for joint maintenance planning and production scheduling under consumable resources constraints”, 44th International conference on computers& industrial engineering, (2014). 5. [5] Wong, C.S., Chan, F.T.S., Chung, S.H., “A genetic algorithm approach for production scheduling with mould maintenance consideration”, International Journal of Production Research, 50(20): 5683–5697, (2012).
|
|