How to cite this paper
Molina-Sánchez, L & González-Neira, E. (2016). GRASP to minimize total weighted tardiness in a permutation flow shop environment.International Journal of Industrial Engineering Computations , 7(1), 161-176.
Refrences
Anandaraman, C. (2011). An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems. International Journal of Industrial Engineering Computations, 2(4), 749–764.
Ara?jo, D. C., & Nagano, M. S. (2011). A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem. International Journal of Industrial Engineering Computations, 2(1), 155–166.
Armentano, V. A., & Araujo, O. C. B. de. (2006). Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times. Journal of Heuristics, 12(6), 427–446.
Armentano, V. A., & de França Filho, M. F. (2007). Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach. European Journal of Operational Research, 183(1), 100–114.
Arroyo, J. E. C., & de Souza Pereira, A. A. (2010). A GRASP heuristic for the multi-objective permutation flowshop scheduling problem. The International Journal of Advanced Manufacturing Technology, 55(5-8), 741–753.
Babaei, M., Mohammadi, M., Ghomi, S. M. T. F., & Sobhanallahi, M. a. (2012). Two parameter-tuned metaheuristic algorithms for the multi-level lot sizing and scheduling problem. International Journal of Industrial Engineering Computations, 3(5), 751–766.
Baker, K. R. (2013). Computational results for the flowshop tardiness problem. Computers & Industrial Engineering, 64(3), 812–816.
Bank, M., Fatemi Ghomi, S. M. T., Jolai, F., & Behnamian, J. (2012). Two-machine flow shop total tardiness scheduling problem with deteriorating jobs. Applied Mathematical Modelling, 36(11), 5418–5426.
Bhongade, A., & Khodke, P. M. (2012). Heuristics for production scheduling problem with machining and assembly operations. International Journal of Industrial Engineering Computations, 3(2), 185–198.
Caballero-Villalobos, J. P., & Alvarado-Valencia, J. A. (2010). Greedy Randomized Adaptive Search Procedure (GRASP): A Valuable Alternative for Minimizing Machine Total Weighted Tardiness. Ingenier?a Y Universidad, 14(2), 275–295.
Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for n job, m machine sequencing problem. Management Science, 16(10), 630–637.
Chandra, P., Mehta, P., & Tirupati, D. (2009). Permutation flow shop scheduling with earliness and tardiness penalties. International Journal of Production Research, 47(20), 5591–5610.
Ciavotta, M., Minella, G., & Ruiz, R. (2013). Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study. European Journal of Operational Research, 227(2), 301–313.
Du, J., & Leung, J. Y.-T. (1990). Minimizing Total Tardiness on One Machine Is NP-Hard. Mathematics of Operations Research, 15(3), 483–495.
Dubois-Lacoste, J., L?pez-Ib??ez, M., & Stützle, T. (2011). A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems. Computers & Operations Research, 38(8), 1219–1236.
El-Bouri, A. (2012). A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop. Computers & Operations Research, 39(7), 1305–1314.
Framinan, J. M., & Leisten, R. (2008). Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm. International Journal of Production Research, 46(22), 6479–6498.
Gupta, A., & Chauhan, S. (2015). A heuristic algorithm for scheduling in a flow shop environment to minimize makespan. International Journal of Industrial Engineering Computations, 6(2), 173–184.
Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61–68.
Kanet, J. J., & Li, X. (2004). A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness. Journal of Scheduling, 7(4), 261–276.
Khalili, M., & Tavakkoli-Moghaddam, R. (2012). A multi-objective electromagnetism algorithm for a bi-objective flowshop scheduling problem. Journal of Manufacturing Systems, 31(2), 232–239.
Kim, Y.-D. (1995). Minimizing total tardiness in permutation flowshops. European Journal of Operational Research, 85(3), 541–555.
Laha, D., & Chakraborty, U. K. (2007). An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling. The International Journal of Advanced Manufacturing Technology, 38(9-10), 1018–1025.
Lee, W.-C., & Chung, Y.-H. (2013). Permutation flowshop scheduling to minimize the total tardiness with learning effects. International Journal of Production Economics, 141(1), 327–334.
Lee, W.-C., Yeh, W.-C., & Chung, Y.-H. (2014). Total tardiness minimization in permutation flowshop with deterioration consideration. Applied Mathematical Modelling, 38(13), 3081–3092.
Li, X., Chen, L., Xu, H., & Gupta, J. N. D. (2015). Trajectory Scheduling Methods for minimizing total tardiness in a flowshop. Operations Research Perspectives, 2, 13–23.
Liao, C. J., Liao, L. M., & Tseng, C. T. (2006). A performance evaluation of permutation vs. non-permutation schedules in a flowshop. International Journal of Production Research, 44(20), 4297–4309.
Liu, Q., Ullah, S., & Zhang, C. (2011). An improved genetic algorithm for robust permutation flowshop scheduling. The International Journal of Advanced Manufacturing Technology, 56(1-4), 345–354.
M’Hallah, R. (2014). Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP. Computers & Industrial Engineering, 75, 142–156.
Naderi-Beni, M., Tavakkoli-Moghaddam, R., Naderi, B., Ghobadian, E., & Pourroust, A. (2012). A two-phase fuzzy programming model for a complex bi-objective no-wait flow shop scheduling. International Journal of Industrial Engineering Computations, 3(4), 617–626.
Nawaz, M., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91–95.
Osman, I., Belouadah, H., Fleszar, K., & Saffar, M. (2009). Hybrid of the weighted minimum slack and shortest processing time dispatching rules for the total weighted tardiness single machine scheduling problem with availability constraints. In Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA) (pp. 202–215). Dublin, Ireland.
Palmer, D. S. (1965). Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time -- A Quick Method of Obtaining a Near Optimum. Operational Research Quarterly, 16(1), 101–107.
Pan, Q.-K., & Ruiz, R. (2013). A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Computers & Operations Research, 40(1), 117–128.
Pinedo, M. L. (2012). Scheduling: Theory, Algorithms and Systems (4th ed.). New York: Springer Science & Business Media.
Prabhaharan, G., Khan, B. S. H., & Rakesh, L. (2005). Implementation of grasp in flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 30(11-12), 1126–1131.
Proth, J.-M. (2007). Scheduling: New trends in industrial environment. Annual Reviews in Control, 31(1), 157–166.
Rajkumar, M., Asokan, P., Anilkumar, N., & Page, T. (2011). A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints. International Journal of Production Research, 49(8), 2409–2423.
Resende, M. C., & Ribeiro, C. (2003). Greedy Randomized Adaptive Search Procedures. In F. Glover & G. Kochenberger (Eds.), Handbook of Metaheuristics SE - 8 (Vol. 57, pp. 219–249). Springer US.
Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2), 479–494.
Ruiz, R., Maroto, C., & Alcaraz, J. (2005). Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165(1), 34–54.
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.
Ruiz, R., & Stützle, T. (2008). An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research, 187(3), 1143–1159.
Sayadi, M. K., Ramezanian, R., & Ghaffari-Nasab, N. (2010). A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. International Journal of Industrial Engineering Computations, 1(1), 1–10.
Schaller, J., & Valente, J. M. S. (2013). A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness. International Journal of Production Research, 51(3), 772–779.
Shahsavari Pour, N., Tavakkoli-Moghaddam, R., & Asadi, H. (2013). Optimizing a multi-objectives flow shop scheduling problem by a novel genetic algorithm. International Journal of Industrial Engineering Computations, 4(3), 345–354.
Shahul Hamid Khan, B., Prabhaharan, G., & Asokan, P. (2007). A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. International Journal of Computer Mathematics, 84(12), 1731–1741.
Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1-2), 59–66.
Sun, Y., Zhang, C., Gao, L., & Wang, X. (2010). Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects. The International Journal of Advanced Manufacturing Technology, 55(5-8), 723–739.
Swaminathan, R., Pfund, M. E., Fowler, J. W., Mason, S. J., & Keha, A. (2007). Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times. Computers & Operations Research, 34(10), 3055–3068.
Swaminathan, R., Pfund, M. E., Fowler, J. W., Mason, S. J., & Keha, A. (2007). Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times. Computers & Operations Research, 34(10), 3055–3068.
Tasgetiren, M. F., Pan, Q.-K., Suganthan, P. N., & Oner, A. (2013). A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Applied Mathematical Modelling, 37(10-11), 6758–6779.
Vallada, E., & Ruiz, R. (2011). A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. European Journal of Operational Research, 211(3), 612–622.
Vallada, E., Ruiz, R., & Minella, G. (2008). Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers & Operations Research, 35(4), 1350–1373.
Vega-Mej?a, C. A., & Caballero-Villalobos, J. P. (2010). Combined Use of GRASP and Path-Relinking during Production Scheduling in order to Minimize Total Weighted Tardiness in a Machine. Ingenier?a Y Universidad, 14(1), 79–96.
Vepsalainen, A., & Morton, T. E. (1987). Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs. Management Science, 33(8), 1036–1047.
Wu, C.-C., & Lee, W.-C. (2009). A note on the total completion time problem in a permutation flowshop with a learning effect. European Journal of Operational Research, 192(1), 343–347.
Xiao, Y.-Y., Zhang, R.-Q., Zhao, Q.-H., & Kaku, I. (2012). Permutation flow shop scheduling with order acceptance and weighted tardiness. Applied Mathematics and Computation, 218(15), 7911–7926.
Yenisey, M. M., & Yagmahan, B. (2014). Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends. Omega, 45, 119–135.
Ara?jo, D. C., & Nagano, M. S. (2011). A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem. International Journal of Industrial Engineering Computations, 2(1), 155–166.
Armentano, V. A., & Araujo, O. C. B. de. (2006). Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times. Journal of Heuristics, 12(6), 427–446.
Armentano, V. A., & de França Filho, M. F. (2007). Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach. European Journal of Operational Research, 183(1), 100–114.
Arroyo, J. E. C., & de Souza Pereira, A. A. (2010). A GRASP heuristic for the multi-objective permutation flowshop scheduling problem. The International Journal of Advanced Manufacturing Technology, 55(5-8), 741–753.
Babaei, M., Mohammadi, M., Ghomi, S. M. T. F., & Sobhanallahi, M. a. (2012). Two parameter-tuned metaheuristic algorithms for the multi-level lot sizing and scheduling problem. International Journal of Industrial Engineering Computations, 3(5), 751–766.
Baker, K. R. (2013). Computational results for the flowshop tardiness problem. Computers & Industrial Engineering, 64(3), 812–816.
Bank, M., Fatemi Ghomi, S. M. T., Jolai, F., & Behnamian, J. (2012). Two-machine flow shop total tardiness scheduling problem with deteriorating jobs. Applied Mathematical Modelling, 36(11), 5418–5426.
Bhongade, A., & Khodke, P. M. (2012). Heuristics for production scheduling problem with machining and assembly operations. International Journal of Industrial Engineering Computations, 3(2), 185–198.
Caballero-Villalobos, J. P., & Alvarado-Valencia, J. A. (2010). Greedy Randomized Adaptive Search Procedure (GRASP): A Valuable Alternative for Minimizing Machine Total Weighted Tardiness. Ingenier?a Y Universidad, 14(2), 275–295.
Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for n job, m machine sequencing problem. Management Science, 16(10), 630–637.
Chandra, P., Mehta, P., & Tirupati, D. (2009). Permutation flow shop scheduling with earliness and tardiness penalties. International Journal of Production Research, 47(20), 5591–5610.
Ciavotta, M., Minella, G., & Ruiz, R. (2013). Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study. European Journal of Operational Research, 227(2), 301–313.
Du, J., & Leung, J. Y.-T. (1990). Minimizing Total Tardiness on One Machine Is NP-Hard. Mathematics of Operations Research, 15(3), 483–495.
Dubois-Lacoste, J., L?pez-Ib??ez, M., & Stützle, T. (2011). A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems. Computers & Operations Research, 38(8), 1219–1236.
El-Bouri, A. (2012). A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop. Computers & Operations Research, 39(7), 1305–1314.
Framinan, J. M., & Leisten, R. (2008). Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm. International Journal of Production Research, 46(22), 6479–6498.
Gupta, A., & Chauhan, S. (2015). A heuristic algorithm for scheduling in a flow shop environment to minimize makespan. International Journal of Industrial Engineering Computations, 6(2), 173–184.
Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61–68.
Kanet, J. J., & Li, X. (2004). A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness. Journal of Scheduling, 7(4), 261–276.
Khalili, M., & Tavakkoli-Moghaddam, R. (2012). A multi-objective electromagnetism algorithm for a bi-objective flowshop scheduling problem. Journal of Manufacturing Systems, 31(2), 232–239.
Kim, Y.-D. (1995). Minimizing total tardiness in permutation flowshops. European Journal of Operational Research, 85(3), 541–555.
Laha, D., & Chakraborty, U. K. (2007). An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling. The International Journal of Advanced Manufacturing Technology, 38(9-10), 1018–1025.
Lee, W.-C., & Chung, Y.-H. (2013). Permutation flowshop scheduling to minimize the total tardiness with learning effects. International Journal of Production Economics, 141(1), 327–334.
Lee, W.-C., Yeh, W.-C., & Chung, Y.-H. (2014). Total tardiness minimization in permutation flowshop with deterioration consideration. Applied Mathematical Modelling, 38(13), 3081–3092.
Li, X., Chen, L., Xu, H., & Gupta, J. N. D. (2015). Trajectory Scheduling Methods for minimizing total tardiness in a flowshop. Operations Research Perspectives, 2, 13–23.
Liao, C. J., Liao, L. M., & Tseng, C. T. (2006). A performance evaluation of permutation vs. non-permutation schedules in a flowshop. International Journal of Production Research, 44(20), 4297–4309.
Liu, Q., Ullah, S., & Zhang, C. (2011). An improved genetic algorithm for robust permutation flowshop scheduling. The International Journal of Advanced Manufacturing Technology, 56(1-4), 345–354.
M’Hallah, R. (2014). Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP. Computers & Industrial Engineering, 75, 142–156.
Naderi-Beni, M., Tavakkoli-Moghaddam, R., Naderi, B., Ghobadian, E., & Pourroust, A. (2012). A two-phase fuzzy programming model for a complex bi-objective no-wait flow shop scheduling. International Journal of Industrial Engineering Computations, 3(4), 617–626.
Nawaz, M., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91–95.
Osman, I., Belouadah, H., Fleszar, K., & Saffar, M. (2009). Hybrid of the weighted minimum slack and shortest processing time dispatching rules for the total weighted tardiness single machine scheduling problem with availability constraints. In Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA) (pp. 202–215). Dublin, Ireland.
Palmer, D. S. (1965). Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time -- A Quick Method of Obtaining a Near Optimum. Operational Research Quarterly, 16(1), 101–107.
Pan, Q.-K., & Ruiz, R. (2013). A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Computers & Operations Research, 40(1), 117–128.
Pinedo, M. L. (2012). Scheduling: Theory, Algorithms and Systems (4th ed.). New York: Springer Science & Business Media.
Prabhaharan, G., Khan, B. S. H., & Rakesh, L. (2005). Implementation of grasp in flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 30(11-12), 1126–1131.
Proth, J.-M. (2007). Scheduling: New trends in industrial environment. Annual Reviews in Control, 31(1), 157–166.
Rajkumar, M., Asokan, P., Anilkumar, N., & Page, T. (2011). A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints. International Journal of Production Research, 49(8), 2409–2423.
Resende, M. C., & Ribeiro, C. (2003). Greedy Randomized Adaptive Search Procedures. In F. Glover & G. Kochenberger (Eds.), Handbook of Metaheuristics SE - 8 (Vol. 57, pp. 219–249). Springer US.
Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2), 479–494.
Ruiz, R., Maroto, C., & Alcaraz, J. (2005). Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165(1), 34–54.
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.
Ruiz, R., & Stützle, T. (2008). An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research, 187(3), 1143–1159.
Sayadi, M. K., Ramezanian, R., & Ghaffari-Nasab, N. (2010). A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. International Journal of Industrial Engineering Computations, 1(1), 1–10.
Schaller, J., & Valente, J. M. S. (2013). A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness. International Journal of Production Research, 51(3), 772–779.
Shahsavari Pour, N., Tavakkoli-Moghaddam, R., & Asadi, H. (2013). Optimizing a multi-objectives flow shop scheduling problem by a novel genetic algorithm. International Journal of Industrial Engineering Computations, 4(3), 345–354.
Shahul Hamid Khan, B., Prabhaharan, G., & Asokan, P. (2007). A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. International Journal of Computer Mathematics, 84(12), 1731–1741.
Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1-2), 59–66.
Sun, Y., Zhang, C., Gao, L., & Wang, X. (2010). Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects. The International Journal of Advanced Manufacturing Technology, 55(5-8), 723–739.
Swaminathan, R., Pfund, M. E., Fowler, J. W., Mason, S. J., & Keha, A. (2007). Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times. Computers & Operations Research, 34(10), 3055–3068.
Swaminathan, R., Pfund, M. E., Fowler, J. W., Mason, S. J., & Keha, A. (2007). Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times. Computers & Operations Research, 34(10), 3055–3068.
Tasgetiren, M. F., Pan, Q.-K., Suganthan, P. N., & Oner, A. (2013). A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Applied Mathematical Modelling, 37(10-11), 6758–6779.
Vallada, E., & Ruiz, R. (2011). A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. European Journal of Operational Research, 211(3), 612–622.
Vallada, E., Ruiz, R., & Minella, G. (2008). Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers & Operations Research, 35(4), 1350–1373.
Vega-Mej?a, C. A., & Caballero-Villalobos, J. P. (2010). Combined Use of GRASP and Path-Relinking during Production Scheduling in order to Minimize Total Weighted Tardiness in a Machine. Ingenier?a Y Universidad, 14(1), 79–96.
Vepsalainen, A., & Morton, T. E. (1987). Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs. Management Science, 33(8), 1036–1047.
Wu, C.-C., & Lee, W.-C. (2009). A note on the total completion time problem in a permutation flowshop with a learning effect. European Journal of Operational Research, 192(1), 343–347.
Xiao, Y.-Y., Zhang, R.-Q., Zhao, Q.-H., & Kaku, I. (2012). Permutation flow shop scheduling with order acceptance and weighted tardiness. Applied Mathematics and Computation, 218(15), 7911–7926.
Yenisey, M. M., & Yagmahan, B. (2014). Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends. Omega, 45, 119–135.