5
How to cite this paper
APA: Antonioli, M., Rodrigues, C & Prata, B. (2022). Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics. International Journal of Industrial Engineering Computations, 13(2), 223-236.
Chicago/Turabian: Antonioli, M., Rodrigues, C & Prata, B. 2022. "Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics." International Journal of Industrial Engineering Computations 13, no. 2 (2022): 223-236.
AMA: Antonioli, M., Rodrigues, C & Prata, B. Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics. International Journal of Industrial Engineering Computations. 2022;13(2):223-236.
References
Fernandez-Viagas, V., & Framinan, J.M. (2015). Neh-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness. Computers and Operations Research, 60, 27– 36.
Fernandez-Viagas, V., Perez-Gonzalez, P., & Framinan, J. M. (2019). Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective. Computers & Operations Research, 109, 77-88.
Framinan, J.M., & Perez-Gonzalez, P. (2017). New approximate algorithms for the customer order scheduling problem with total completion time objective. Computers and Operations Research, 78, 181 – 192.
Framinan, J.M., & Perez-Gonzalez, P. (2018). Order scheduling with tardiness objective: Improved approximate solutions. European Journal of Operational Research, 266(3), 840 – 850.
Framinan, J.M., Perez-Gonzalez, P., & Fernandez-Viagas, V. (2019). Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. European Journal of Operational Research, 273(2), 401 – 417.
Karabulut, K. (2016). A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops. Computers and Industrial Engineering, 98, 300 – 307.
Kim, Y.D. (1993). Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of the Operational Research Society, 44(1), 19–28.
Kung, J.Y., Duan, J., Xu, J., Chung, I., Cheng, S.R., Wu, C.C., Lin, W.C., et al. (2018). Metaheuristics for order scheduling problem with unequal ready times. Discrete Dynamics in Nature and Society.
Lee, I.S. (2013). Minimizing total tardiness for the order scheduling problem. International Journal of Production Economics, 144(1), 128 – 134.
Leung, J.Y.T., Li, H., & Pinedo, M. (2005a). Order scheduling models: An overview. Multidisciplinary Scheduling: Theory and Applications, Springer US, Boston, MA., 37–53.
Leung, J.Y.T., Li, H., & Pinedo, M. (2005b). Order scheduling in an environment with dedicated re-sources in parallel. Journal of Scheduling, 8(5), 355–386.
Leung, J.Y.T., Li, H., & Pinedo, M. (2006). Scheduling orders for multiple product types with duedate related objectives. European Journal of Operational Research, 168(2), 370 – 389.
Lin, W.C., Xu, J., Bai, D., Chung, I.H., Liu, S.C., & Wu, C.C. (2019). Artificial bee colony algorithmsfor the order scheduling with release dates. Soft Computing, 23(18), 8677–8688.
Michael, L.P. (2018). Scheduling: theory, algorithms, and systems. Springer.
Prata, B.A., Rodrigues, C.D., & Framinan, J.M. (2021a). Customer order scheduling problem to minimize makespan with sequence-dependent setup times. Computers & Industrial Engineering, 151, 106962.
Prata, B.A., Rodrigues, C.D., & Framinan, J.M. (2021b). A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times. Expert Systems With Applications, 116097.
Riahi, V., Newton, M.H., Polash, M., & Sattar, A. (2019). Tailoring customer order scheduling search algorithms. Computers & Operations Research, 108, 155 – 165.
Roemer, T.A. (2006). A note on the complexity of the concurrent open shop problem. Journal of Scheduling, 9(4), 389–396.
Wagneur, E., Sriskandarajah, C. (1993). Openshops with jobs overlap. European Journal of Operational Research, 71(3), 366 – 378.
Wu, C.C., Yang, T.H., Zhang, X., Kang, C.C., Chung, I.H., Lin, W.C. (2019). Using heuristic and iterative greedy algorithms for the total weighted completion time order scheduling with release times. Swarm and Evolutionary Computation, 44, 913 – 926.
Wu, C. C., Bai, D., Zhang, X., Cheng, S. R., Lin, J. C., Wu, Z. L., & Lin, W. C. (2021). A robust customer order scheduling problem along with scenario-dependent component processing times and due dates. Journal of Manufacturing Systems, 58, 291-305.
Fernandez-Viagas, V., Perez-Gonzalez, P., & Framinan, J. M. (2019). Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective. Computers & Operations Research, 109, 77-88.
Framinan, J.M., & Perez-Gonzalez, P. (2017). New approximate algorithms for the customer order scheduling problem with total completion time objective. Computers and Operations Research, 78, 181 – 192.
Framinan, J.M., & Perez-Gonzalez, P. (2018). Order scheduling with tardiness objective: Improved approximate solutions. European Journal of Operational Research, 266(3), 840 – 850.
Framinan, J.M., Perez-Gonzalez, P., & Fernandez-Viagas, V. (2019). Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. European Journal of Operational Research, 273(2), 401 – 417.
Karabulut, K. (2016). A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops. Computers and Industrial Engineering, 98, 300 – 307.
Kim, Y.D. (1993). Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of the Operational Research Society, 44(1), 19–28.
Kung, J.Y., Duan, J., Xu, J., Chung, I., Cheng, S.R., Wu, C.C., Lin, W.C., et al. (2018). Metaheuristics for order scheduling problem with unequal ready times. Discrete Dynamics in Nature and Society.
Lee, I.S. (2013). Minimizing total tardiness for the order scheduling problem. International Journal of Production Economics, 144(1), 128 – 134.
Leung, J.Y.T., Li, H., & Pinedo, M. (2005a). Order scheduling models: An overview. Multidisciplinary Scheduling: Theory and Applications, Springer US, Boston, MA., 37–53.
Leung, J.Y.T., Li, H., & Pinedo, M. (2005b). Order scheduling in an environment with dedicated re-sources in parallel. Journal of Scheduling, 8(5), 355–386.
Leung, J.Y.T., Li, H., & Pinedo, M. (2006). Scheduling orders for multiple product types with duedate related objectives. European Journal of Operational Research, 168(2), 370 – 389.
Lin, W.C., Xu, J., Bai, D., Chung, I.H., Liu, S.C., & Wu, C.C. (2019). Artificial bee colony algorithmsfor the order scheduling with release dates. Soft Computing, 23(18), 8677–8688.
Michael, L.P. (2018). Scheduling: theory, algorithms, and systems. Springer.
Prata, B.A., Rodrigues, C.D., & Framinan, J.M. (2021a). Customer order scheduling problem to minimize makespan with sequence-dependent setup times. Computers & Industrial Engineering, 151, 106962.
Prata, B.A., Rodrigues, C.D., & Framinan, J.M. (2021b). A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times. Expert Systems With Applications, 116097.
Riahi, V., Newton, M.H., Polash, M., & Sattar, A. (2019). Tailoring customer order scheduling search algorithms. Computers & Operations Research, 108, 155 – 165.
Roemer, T.A. (2006). A note on the complexity of the concurrent open shop problem. Journal of Scheduling, 9(4), 389–396.
Wagneur, E., Sriskandarajah, C. (1993). Openshops with jobs overlap. European Journal of Operational Research, 71(3), 366 – 378.
Wu, C.C., Yang, T.H., Zhang, X., Kang, C.C., Chung, I.H., Lin, W.C. (2019). Using heuristic and iterative greedy algorithms for the total weighted completion time order scheduling with release times. Swarm and Evolutionary Computation, 44, 913 – 926.
Wu, C. C., Bai, D., Zhang, X., Cheng, S. R., Lin, J. C., Wu, Z. L., & Lin, W. C. (2021). A robust customer order scheduling problem along with scenario-dependent component processing times and due dates. Journal of Manufacturing Systems, 58, 291-305.