Abstract
In the Job-shop scheduling problem minimizing the makespan has been the dominant approach in the literature. The level of the customer service cannot be measured efficiently for this criterion, since it does not consider relevant aspects like the due date of jobs to determine the tardiness. In this paper, we propose an innovate general approach for minimizing regular criteria in the Job-shop Scheduling which adds the conditions of maintenance activities and sequence dependent set-up times considering the Pareto optimization. Our approach makes use of the disjunctive graph model to represent schedules and support the search for an optimal solution using a classical estimation function at reversing a critical arc. The search is performed by two phases: improvement and diversification. In the improvement phase, initially, a random criterion is selected to create improving moves iteratively. When it is not possible to create a move using the selected criterion, it is penalized and a new criterion is selected. The diversification phase considers feasibility conditions to escape from a local optimal. In each move the set of solutions of the front is updated. The efficiency of our approach is illustrated on instances of literature at performing three sets of criteria. The first set considers makespan and maximum tardiness. In the second \( \sum C_{i} \) is considered and in the third the total tardiness. As a contribution of our approach, a benchmark of results is proposed by future research.
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
Zandieh, M., Khatami, A., Rahmati, S.: Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm. Appl. Soft Comput. J. 58, 449–464 (2017)
Rahmati, S., Ahmadi, A., Govindan, K.: A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach. Ann. Oper. Res. 269(1–2), 583–621 (2018)
Cassady, C., Kutanoglu, E.: Integrating preventive maintenance planning and production scheduling for a single machine. IEEE Trans. Reliab. 54(2), 304–309 (2005)
Finke, G., Gara-Ali, A., Espinouse, M., Jost, V., Moncel, J.: Unified matrix approach to solve production-maintenance problems on a single machine. Omega (United Kingdom) 66, 140–146 (2017)
Rebai, M., Kacem, I., Adjallah, K.: Earliness-tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods. J. Intell. Manuf. 23(4), 1207–1224 (2012)
Lei, D., Liu, M.: An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance. Comput. Ind. Eng. 141, 106320 (2020)
Shen, J., Zhu, Y.: A parallel-machine scheduling problem with periodic maintenance under uncertainty. J. Ambient Intell. Humaniz. Comput. 10(8), 3171–3179 (2018). https://doi.org/10.1007/s12652-018-1032-8
Pérez-González, P., Fernández-Viagas, V., Framinan, J.: Permutation flowshop scheduling with periodic maintenance and makespan objective. Comput. Ind. Eng. 143, 106369 (2020)
Miyata, H., Nagano, M., Gupta, J.: Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study. Eng. Optim. 51(4), 680–698 (2019)
Boufellouh, R., Belkaid, F.: Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem. Comput. Oper. Res. 122, 104943 (2020)
Miyata, H., Nagano, M., Gupta, J.: Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Comput. Ind. Eng. 135, 79–104 (2019)
Naderi, B., Zandieh, M., Fatemi Ghomi, S.: A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling. J. Intell. Manuf. 20(6), 683–694 (2009)
Khamseh, A., Jolai, F., Babaei, M.: Integrating sequence-dependent group scheduling problem and preventive maintenance in flexible flow shops. Int. J. Adv. Manuf. Technol. 77(1–4), 173–185 (2014)
Ben Ali, M., Sassi, M., Gossa, M., Harrath, Y.: Simultaneous scheduling of production and maintenance tasks in the job shop. Int. J. Prod. Res. 49(13), 3891–3918 (2011)
Naderi, B., Zandieh, M., Fatemi Ghomi, S.: Scheduling sequence-dependent setup time job shops with preventive maintenance. Int. J. Adv. Manuf. Technol. 43(1–2), 170–181 (2009)
Rahmati, S., Ahmadi, A., Karimi, B.: Multi-objective evolutionary simulation based optimization mechanism for a novel stochastic reliability centered maintenance problem. Swarm Evol. Comput. 40, 255–271 (2018)
Vela, C., Varela, R., González, M.: Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. J. Heuristics 16(2), 139–165 (2010)
Bürgy, R.: A neighborhood for complex job shop scheduling problems with regular objectives. J. Sched. 20(4), 391–422 (2017). https://doi.org/10.1007/s10951-017-0532-2
Mati, Y., Dauzère-Pérès, S., Lahlou, C.: A general approach for optimizing regular criteria in the job-shop scheduling problem. Eur. J. Oper. Res. 212(1), 33–42 (2011)
García-León, A.A., Dauzère-Pérès, S., Mati, Y.: An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Comput. Oper. Res. 108, 187–200 (2019)
García-León, A.A., Torres Tapia, W.F.: A general local search pareto approach with regular criteria for solving the job-shop scheduling problem multi-resource resource flexibility with linear routes. In: Figueroa-García, J.C., Duarte-González, M., Jaramillo-Isaza, S., Orjuela-Cañon, A.D., Díaz-Gutierrez, Y. (eds.) WEA 2019. CCIS, vol. 1052, pp. 764–775. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31019-6_64
Singer, M., Pinedo, M.: A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Trans. 30(2), 109–118 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
García-León, A.A., Torres Tapia, W.F. (2020). A Fast Pareto Approach to Minimize Regular Criteria in the Job-shop Scheduling Problem with Maintenance Activities, Sequence Dependent and Set-up Times. In: Figueroa-García, J.C., Garay-Rairán, F.S., Hernández-Pérez, G.J., Díaz-Gutierrez, Y. (eds) Applied Computer Sciences in Engineering. WEA 2020. Communications in Computer and Information Science, vol 1274. Springer, Cham. https://doi.org/10.1007/978-3-030-61834-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-61834-6_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-61833-9
Online ISBN: 978-3-030-61834-6
eBook Packages: Computer ScienceComputer Science (R0)