How to cite this paper
Allahverdi, A., Aydilek, H & Aydilek, A. (2022). An algorithm for a no-wait flowshop scheduling problem for minimizing total tardiness with a constraint on total completion time.International Journal of Industrial Engineering Computations , 13(1), 43-50.
Refrences
Aldowaisan, T., & Allahverdi, A. (2004). New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega, 32(5), 345-352.
Allahverdi, A. (2012). Minimizing total tardiness in no-wait flowshops. Foundations of Computing and Decision Sciences, 37(3), 149-162.
Allahverdi, A. (2015). The third comprehensive survey on scheduling problems with setup times/costs. European Journal of Operational Research, 246(2), 345-378.
Allahverdi, A. (2016). A survey of scheduling problems with no-wait in process. European Journal of Operational Research, 255(3), 665-686.
Allahverdi, A., & Aldowaisan, T. (2004). No-wait flowshops with bicriteria of makespan and maximum lateness. European Journal of Operational Research, 152(1), 132-147.
Allahverdi, A., & Aydilek, H. (2013). Algorithms for no-wait flowshops with total completion time subject to makespan. The International Journal of Advanced Manufacturing Technology, 68(9-12), 2237-2251.
Allahverdi, A., & Aydilek, H. (2014). Total completion time with makespan constraint in no-wait flowshops with setup times. European Journal of Operational Research, 238(3), 724-734.
Allahverdi, A., Aydilek, H., & Aydilek, A. (2018). No-wait flowshop scheduling problem with two criteria; total tardiness and makespan. European Journal of Operational Research, 269(2), 590-601.
Allahverdi, A., Aydilek, H., & Aydilek, A. (2020). No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan. Applied Mathematics and Computation, 365, 124688.
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.
Aydilek, H., & Allahverdi, A. (2012). Heuristics for no-wait flowshops with makespan subject to mean completion time. Applied Mathematics and Computation, 219(1), 351-359.
Aydilek, H., & Allahverdi, A. (2013). New heuristics for no-wait flowshops with performance measures of makespan and mean completion time. International Journal of Operations Research, 10, 29-37.
Chen, C. L., Neppalli, R. V., & Aljaber, N. (1996). Genetic algorithms applied to the continuous flow shop problem. Computers & Industrial Engineering, 30(4), 919-929.
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.
Fink, A., & Voß, S. (2003). Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research, 151(2), 400-414.
Framinan, J. M., Nagano, M. S., & Moccellin, J. V. (2010). An efficient heuristic for total flowtime minimisation in no-wait flowshops. The International Journal of Advanced Manufacturing Technology, 46(9-12), 1049-1057.
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.
Hecker, F. T., Stanke, M., Becker, T., & Hitzmann, B. (2014). Application of a modified GA, ACO and a random search procedure to solve the production scheduling of a case study bakery. Expert systems with applications, 41(13), 5882-5891.
Jenabi, M., Naderi, B., & Ghomi, S. F. (2010, September). A bi-objective case of no-wait flowshops. In 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) (pp. 1048-1056). IEEE.
Lee, J. Y., & Kim, Y. D. (2017). Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine. Computers & Industrial Engineering, 114, 22-30.
Liu, G., Song, S., & Wu, C. (2013). Some heuristics for no-wait flowshops with total tardiness criterion. Computers & operations research, 40(2), 521-525.
Nagano, M. S., Da Silva, A. A., & Lorena, L. A. N. (2012). A new evolutionary clustering search for a no-wait flow shop problem with set-up times. Engineering Applications of Artificial Intelligence, 25(6), 1114-1120.
Pan, Q. K., Tasgetiren, M. F., & Liang, Y. C. (2008). A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operations Research, 35(9), 2807-2839.
Pan, Q. K., & Wang, L. (2008). A novel multi-objective particle swarm optimization algorithm for no-wait flow shop scheduling problems. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 222(4), 519-539.
Pan, Q. K., Wang, L., & Qian, B. (2009). A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Computers & Operations Research, 36(8), 2498-2511.
Qian, B., Wang, L., Huang, D. X., & Wang, X. (2009). Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution. Soft Computing, 13(8), 847-869.
Rajendran, C., & Chaudhuri, D. (1990). Heuristic algorithms for continuous flow‐shop problem. Naval Research Logistics (NRL), 37(5), 695-705.
Ruiz, R., & Allahverdi, A. (2009). New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness. International Journal of Production Research, 47(20), 5717-5738.
Ruiz-Torres, A. J., Paletta, G., & M’Hallah, R. (2017). Makespan minimisation with sequence-dependent machine deterioration and maintenance events. International Journal of Production Research, 55(2), 462-479.
Shao, Z., Pi, D., & Shao, W. (2017). Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness. Computers & Industrial Engineering, 111, 331-351.
Shyu, S. J., Lin, B. M., & Yin, P. Y. (2004). Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Computers & industrial engineering, 47(2-3), 181-193.
T'kindt, V., & Billaut, J. C. (2006). Multicriteria scheduling: theory, models and algorithms. Springer Science & Business Media.
Wang, Y., Tang, J., Pan, Z., & Yan, C. (2015). Particle swarm optimization-based planning and scheduling for a laminar-flow operating room with downstream resources. Soft Computing, 19(10), 2913-2926.
Allahverdi, A. (2012). Minimizing total tardiness in no-wait flowshops. Foundations of Computing and Decision Sciences, 37(3), 149-162.
Allahverdi, A. (2015). The third comprehensive survey on scheduling problems with setup times/costs. European Journal of Operational Research, 246(2), 345-378.
Allahverdi, A. (2016). A survey of scheduling problems with no-wait in process. European Journal of Operational Research, 255(3), 665-686.
Allahverdi, A., & Aldowaisan, T. (2004). No-wait flowshops with bicriteria of makespan and maximum lateness. European Journal of Operational Research, 152(1), 132-147.
Allahverdi, A., & Aydilek, H. (2013). Algorithms for no-wait flowshops with total completion time subject to makespan. The International Journal of Advanced Manufacturing Technology, 68(9-12), 2237-2251.
Allahverdi, A., & Aydilek, H. (2014). Total completion time with makespan constraint in no-wait flowshops with setup times. European Journal of Operational Research, 238(3), 724-734.
Allahverdi, A., Aydilek, H., & Aydilek, A. (2018). No-wait flowshop scheduling problem with two criteria; total tardiness and makespan. European Journal of Operational Research, 269(2), 590-601.
Allahverdi, A., Aydilek, H., & Aydilek, A. (2020). No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan. Applied Mathematics and Computation, 365, 124688.
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.
Aydilek, H., & Allahverdi, A. (2012). Heuristics for no-wait flowshops with makespan subject to mean completion time. Applied Mathematics and Computation, 219(1), 351-359.
Aydilek, H., & Allahverdi, A. (2013). New heuristics for no-wait flowshops with performance measures of makespan and mean completion time. International Journal of Operations Research, 10, 29-37.
Chen, C. L., Neppalli, R. V., & Aljaber, N. (1996). Genetic algorithms applied to the continuous flow shop problem. Computers & Industrial Engineering, 30(4), 919-929.
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.
Fink, A., & Voß, S. (2003). Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research, 151(2), 400-414.
Framinan, J. M., Nagano, M. S., & Moccellin, J. V. (2010). An efficient heuristic for total flowtime minimisation in no-wait flowshops. The International Journal of Advanced Manufacturing Technology, 46(9-12), 1049-1057.
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.
Hecker, F. T., Stanke, M., Becker, T., & Hitzmann, B. (2014). Application of a modified GA, ACO and a random search procedure to solve the production scheduling of a case study bakery. Expert systems with applications, 41(13), 5882-5891.
Jenabi, M., Naderi, B., & Ghomi, S. F. (2010, September). A bi-objective case of no-wait flowshops. In 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) (pp. 1048-1056). IEEE.
Lee, J. Y., & Kim, Y. D. (2017). Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine. Computers & Industrial Engineering, 114, 22-30.
Liu, G., Song, S., & Wu, C. (2013). Some heuristics for no-wait flowshops with total tardiness criterion. Computers & operations research, 40(2), 521-525.
Nagano, M. S., Da Silva, A. A., & Lorena, L. A. N. (2012). A new evolutionary clustering search for a no-wait flow shop problem with set-up times. Engineering Applications of Artificial Intelligence, 25(6), 1114-1120.
Pan, Q. K., Tasgetiren, M. F., & Liang, Y. C. (2008). A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operations Research, 35(9), 2807-2839.
Pan, Q. K., & Wang, L. (2008). A novel multi-objective particle swarm optimization algorithm for no-wait flow shop scheduling problems. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 222(4), 519-539.
Pan, Q. K., Wang, L., & Qian, B. (2009). A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Computers & Operations Research, 36(8), 2498-2511.
Qian, B., Wang, L., Huang, D. X., & Wang, X. (2009). Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution. Soft Computing, 13(8), 847-869.
Rajendran, C., & Chaudhuri, D. (1990). Heuristic algorithms for continuous flow‐shop problem. Naval Research Logistics (NRL), 37(5), 695-705.
Ruiz, R., & Allahverdi, A. (2009). New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness. International Journal of Production Research, 47(20), 5717-5738.
Ruiz-Torres, A. J., Paletta, G., & M’Hallah, R. (2017). Makespan minimisation with sequence-dependent machine deterioration and maintenance events. International Journal of Production Research, 55(2), 462-479.
Shao, Z., Pi, D., & Shao, W. (2017). Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness. Computers & Industrial Engineering, 111, 331-351.
Shyu, S. J., Lin, B. M., & Yin, P. Y. (2004). Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Computers & industrial engineering, 47(2-3), 181-193.
T'kindt, V., & Billaut, J. C. (2006). Multicriteria scheduling: theory, models and algorithms. Springer Science & Business Media.
Wang, Y., Tang, J., Pan, Z., & Yan, C. (2015). Particle swarm optimization-based planning and scheduling for a laminar-flow operating room with downstream resources. Soft Computing, 19(10), 2913-2926.