Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance

Yamada, T.; Nagano, M.; Miyata, H.

Abstract: Efficient business organizations must balance quality, cost, and time constraints in competitive environments. Reflecting the complexity of this task, we consider manufacturing systems including several stages of production chains requiring time measurement. When production scheduling is not prioritized in such enterprises, several negative effects may occur. A corporation may suffer financial penalties as well as negative brand exposure, and thus may find its credibility challenged. Therefore, in this study, we propose constructive methods to minimize a total tardiness criterion, considering preventative maintenance constraints to reflect the reality of industrial practice, focusing on a no-wait flowshop environment in which jobs are successively processed without operational interruptions. In addition to proposing constructive methods to solve the no-wait flowshop production scheduling problem, a metaheuristic is presented as an approach to improve results obtained by constructive methods. Computational experiments were designed and performed to compare several production scheduling algorithms. Among various constructive heuristics considered, an algorithm called HENLL using an insertion logic showed the best performance. The proposed metaheuristic is based on the iterated greedy (IG) search method, and the results obtained demonstrated significant improvement compared to the heuristics alone. It is expected that this study may be used by production planning and control (PPC) professionals to apply the proposed method to schedule production more efficiently. We show that the proposed method successfully presented a better solution in relation to total tardiness, considering the above mentioned environment.

How to cite this paper

 Yamada, T., Nagano, M & Miyata, H. (2021). Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance.International Journal of Industrial Engineering Computations , 12(4), 415-426.

References

Aldowaisan, T. A., & Allahverdi, A. (2012). No-wait flowshop scheduling problem to minimize the number of tardy jobs. The International Journal of Advanced Manufacturing Technology, 61(1-4), 311-323.
Aldowaisan, T., & Allahverdi, A. (2015). No-wait flowshops to minimize total tardiness with setup times. Intelligent Control and Automation, 6(01), 38.
Arabameri, S., & Salmasi, N. (2013). Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem. Computers & Industrial Engineering, 64(4), 902-916..
Bertolissi, E. (2000). Heuristic algorithm for scheduling in the no-wait flow-shop. Journal of Materials Processing Technology, 107(1-3), 459-465.
Cai, Y., Hasenbein, J. J., Kutanoglu, E., & Liao, M. (2013). Single-machine multiple-recipe predictive maintenance. Probability in the Engineering and Informational Sciences, 27(2), 209-235.
Cheng, G. Q., Zhou, B. H., & Li, L. (2017). Joint optimization of lot sizing and condition-based maintenance for multi-component production systems. Computers & Industrial Engineering, 110, 538–549.
Ding, J., Song, S., Zhang, R., Gupta, J. N., & Wu, C. (2015). Accelerated methods for total tardiness minimisation in no-wait flowshops. International Journal of Production Research, 53(4), 1002-1018.
Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44(3), 510-525.
Liu, G., Song, S., & Wu, C. (2013). Some heuristics for no-wait flowshops with total tardiness criterion. Computers & Operations Research, 40(2), 521-525..
Maccarthy, B. L., & Liu, J. (1993). Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling. The International Journal of Production Research, 31(1), 59-79.
Macchiaroli, R., Mole, S., & Riemma, S. (1999). Modelling and optimization of industrial manufacturing processes subject to no-wait constraints. International Journal of Production Research, 37(11), 2585-2607.
Miyata, H. H., Nagano, M. S., & Gupta, J. N. (2019). Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study. Engineering Optimization, 51(4), 680-698.
Miyata, H. H., Nagano, M. S., & Gupta, J. N. (2019b). Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Computers & Industrial Engineering, 135, 79–104.
Naderi, B., & Arshadi, A. (2013). Scheduling a variant of flowshop problems to minimize total tardiness. Technical Journal of Engineering and Applied Sciences, 3, 3142–3149.
Perez-Gonzalez, P., Fernandez-Viagas, V., & Framinan, J. M. (2020). Permutation flowshop scheduling with periodic maintenance and makespan objective. Computers & Industrial Engineering, 143, 106369.
Pinedo, M. L. (2008). Scheduling: Theory, algorithms, and systems. New York: Springer.
Reddi, S. S., & Ramamoorthy, C. V. (1972). On the flow-shop sequencing problem with no wait in process. Journal of the Operational Research Society, 23(3), 323-331.
Ribas, I., Companys, R., & Tort-Martorell, X. (2013). An efficient iterated local search algorithm for the total tardiness blocking flow shop problem. International Journal of Production Research, 51(17), 5238-5252.
Ronconi, D. P., & Henriques, L. R. (2009). Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega, 37(2), 272-281.
Ruiz, R., & Allahverdi, A. (2007). No-wait flowshop with separate setup times to minimize maximum lateness. The International Journal of Advanced Manufacturing Technology, 35(5), 551-565.
Ruiz, R., García-Díaz, J. C., & Maroto, C. (2007). Considering scheduling and preventive maintenance in the flowshop sequencing problem. Computers & Operations Research, 34(11), 3314-3330.
Ruiz, R., & Stützle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033-2049.
Wismer, D. A. (1972). Solution of the flowshop-scheduling problem with no intermediate queues. Operations research, 20(3), 689-697.