How to cite this paper
Baskar, A. (2016). Revisiting the NEH algorithm- the power of job insertion technique for optimizing the makespan in permutation flow shop scheduling.International Journal of Industrial Engineering Computations , 7(2), 353-366.
Refrences
Anc?u, M. (2012). On solving flowshop scheduling problems. Proceedings of the Romanian Academy. Series A, 13(1), 71-79
Baskar, A., & Xavior, M. (2013). Optimization of makespan in flow shop scheduling problems using combinational NEH family of heuristics-An analysis. International Journal of Applied Engineering Research, 8(10), 1205-1217.
Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for the n job, m machine sequencing problem. Management Science, 16(10), B-630.
Caraffa, V., Ianes, S., Bagchi, T. P., & Sriskandarajah, C. (2001). Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics, 70(2), 101-115.
Chakraborty, U. K., & Laha, D. (2007). An improved heuristic for permutation flowshop scheduling. International Journal of Information and Communication Technology, 1(1), 89-97.
Chen, C. L., Vempati, V. S., & Aljaber, N. (1995). An application of genetic algorithms for flow shop problems. European Journal of Operational Research, 80(2), 389-396.
Dannenbring, D. G. (1977). An evaluation of flow shop sequencing heuristics. Management Science, 23(11), 1174-1182.
Dong, X., Huang, H., & Chen, P. (2008). An improved NEH-based heuristic for the permutation flowshop problem. Computers & Operations Research, 35(12), 3962-3968.
Erdo?mu?, P. (2010). Particle swarm optimization performance on special linear programming problems. Scientific Research and Essays, 5(12), 1506-1518.
Fernandez-Viagas, V., & Framinan, J. M. (2014). On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. Computers & Operations Research, 45, 60-67.
Framinan, J. M., Leisten, R., & Rajendran, C. (2003). Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. International Journal of Production Research, 41(1), 121-148.
Gantt, H. L. (1919). Organizing for work. Harcourt, Brace and Howe.
Gajpal, Y., & Rajendran, C. (2006). An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. International Journal of Production Economics, 101(2), 259-272.
Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117-129.
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.
Gupta, J. N. (1971). A functional heuristic algorithm for the flowshop scheduling problem. Operational Research Quarterly, 39-47.
Hundal, T. S., & Rajgopal, J. (1988). An extension of Palmer & apos; s heuristic for the flow shop scheduling problem. The International Journal Of Production Research, 26(6), 1119-1124.
Ishibuchi, H., Misaki, S., & Tanaka, H. (1995). Modified simulated annealing algorithms for the flow shop sequencing problem. European Journal of Operational Research, 81(2), 388-398.
Johnson, S. M. (1954). Optimal two?and three?stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61-68.
Kalczynski, P. J., & Kamburowski, J. (2007). On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega, 35(1), 53-60.
Kalczynski, P. J., & Kamburowski, J. (2008). An improved NEH heuristic to minimize makespan in permutation flow shops. Computers & Operations Research, 35(9), 3001-3008.
Koulamas, C. (1998). A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research, 105(1), 66-71.
Land, A. H., & Doig, A. G. (1960). An automatic method of solving discrete programming problems. Econometrica: Journal of the Econometric Society, 497-520.
Liu, G., Song, S., & Wu, C. (2012). Two techniques to improve the NEH algorithm for flow-shop scheduling problems. In Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence (pp. 41-48). Springer Berlin Heidelberg.
Murata, T., Ishibuchi, H., & Tanaka, H. (1996). Genetic algorithms for flowshop scheduling problems. Computers & Industrial Engineering, 30(4), 1061-1071.
Nagano, M. S., & Moccellin, J. V. (2002). A high quality solution constructive heuristic for flow shop sequencing. Journal of the Operational Research Society, 53(12), 1374-1379.
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.
Nowicki, E., & Smutnicki, C. (1996). A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research, 91(1), 160-175.
Ogbu, F. A., & Smith, D. K. (1990). The application of the simulated annealing algorithm to the solution of the n/m/C max flowshop problem. Computers & Operations Research, 17(3), 243-253.
Onwubolu, G., & Davendra, D. (2006). Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research, 171(2), 674-692.
Osman, I. H., & Potts, C. N. (1989). Simulated annealing for permutation flow-shop scheduling. Omega, 17(6), 551-557.
Palmer, D. (1965). Sequencing jobs through a multi-stage process in the minimum total time--a quick method of obtaining a near optimum. OR, 101-107.
Pinedo, M. L. (2012). Scheduling: Theory, Algorithms, and Systems. Springer Science & Business Media.
Ponnambalam, S. G., Aravindan, P., & Chandrasekaran, S. (2001). Constructive and improvement flow shop scheduling heuristics: an extensive evaluation. Production Planning & Control, 12(4), 335-344.
Pour, H. D. (2001). A new heuristic for the n-job, m-machine flow-shop problem. Production Planning & Control, 12(7), 648-653.
Rajendran, C. (1993). Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics, 29(1), 65-73.
Reza Hejazi*, S., & Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research, 43(14), 2895-2929.
Ribas, I., & Mateo, M. (2010). Improvement tools for NEH based heuristics on permutation and blocking flow shop scheduling problems. In Advances in Production Management Systems. New Challenges, New Approaches (pp. 33-40). Springer Berlin Heidelberg.
Reeves, C. R. (1995). A genetic algorithm for flowshop sequencing. Computers & Operations Research, 22(1), 5-13.
Ronconi, D. P. (2004). A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics, 87(1), 39-48.
Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research,165(2), 479-494.
Sarin, S., & Lefoka, M. (1993). Scheduling heuristic for the n-jobm-machine flow shop. Omega, 21(2), 229-234.
Sayadi, M., 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.
Seman?o, P., & Modr?k, V. (2012). A Comparison of Constructive Heuristics with the Objective of Minimizing Makespan in the Flow-Shop Scheduling Problem. Acta Polytechnica Hungarica, 9(5).
Singhal, E., Singh, S., & Dayma, A. (2012). An Improved Heuristic for Permutation Flow Shop Scheduling. In NEH ALGORITHM). International Journal of Computational Engineering Research, 2(6), 95-100.
Suliman, S. M. A. (2000). A two-phase heuristic approach to the permutation flow-shop scheduling problem. International Journal of Production Economics,64(1), 143-152.
Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European journal of Operational research, 47(1), 65-74.
Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278-285.
Widmer, M., & Hertz, A. (1989). A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research, 41(2), 186-193.
Xiao-ping, L., Yue-Xuan, W., & Cheng, W. (2004, June). Heuristic algorithms for large flowshop scheduling problems. In Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on (Vol. 4, pp. 2999-3003). IEEE.
Yin, M., Zou, T., & Gu, W. (2010). Reverse Bridge Theorem under Constraint Partition. Mathematical Problems in Engineering, 2010.
Baskar, A., & Xavior, M. (2013). Optimization of makespan in flow shop scheduling problems using combinational NEH family of heuristics-An analysis. International Journal of Applied Engineering Research, 8(10), 1205-1217.
Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for the n job, m machine sequencing problem. Management Science, 16(10), B-630.
Caraffa, V., Ianes, S., Bagchi, T. P., & Sriskandarajah, C. (2001). Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics, 70(2), 101-115.
Chakraborty, U. K., & Laha, D. (2007). An improved heuristic for permutation flowshop scheduling. International Journal of Information and Communication Technology, 1(1), 89-97.
Chen, C. L., Vempati, V. S., & Aljaber, N. (1995). An application of genetic algorithms for flow shop problems. European Journal of Operational Research, 80(2), 389-396.
Dannenbring, D. G. (1977). An evaluation of flow shop sequencing heuristics. Management Science, 23(11), 1174-1182.
Dong, X., Huang, H., & Chen, P. (2008). An improved NEH-based heuristic for the permutation flowshop problem. Computers & Operations Research, 35(12), 3962-3968.
Erdo?mu?, P. (2010). Particle swarm optimization performance on special linear programming problems. Scientific Research and Essays, 5(12), 1506-1518.
Fernandez-Viagas, V., & Framinan, J. M. (2014). On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. Computers & Operations Research, 45, 60-67.
Framinan, J. M., Leisten, R., & Rajendran, C. (2003). Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. International Journal of Production Research, 41(1), 121-148.
Gantt, H. L. (1919). Organizing for work. Harcourt, Brace and Howe.
Gajpal, Y., & Rajendran, C. (2006). An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. International Journal of Production Economics, 101(2), 259-272.
Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117-129.
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.
Gupta, J. N. (1971). A functional heuristic algorithm for the flowshop scheduling problem. Operational Research Quarterly, 39-47.
Hundal, T. S., & Rajgopal, J. (1988). An extension of Palmer & apos; s heuristic for the flow shop scheduling problem. The International Journal Of Production Research, 26(6), 1119-1124.
Ishibuchi, H., Misaki, S., & Tanaka, H. (1995). Modified simulated annealing algorithms for the flow shop sequencing problem. European Journal of Operational Research, 81(2), 388-398.
Johnson, S. M. (1954). Optimal two?and three?stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61-68.
Kalczynski, P. J., & Kamburowski, J. (2007). On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega, 35(1), 53-60.
Kalczynski, P. J., & Kamburowski, J. (2008). An improved NEH heuristic to minimize makespan in permutation flow shops. Computers & Operations Research, 35(9), 3001-3008.
Koulamas, C. (1998). A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research, 105(1), 66-71.
Land, A. H., & Doig, A. G. (1960). An automatic method of solving discrete programming problems. Econometrica: Journal of the Econometric Society, 497-520.
Liu, G., Song, S., & Wu, C. (2012). Two techniques to improve the NEH algorithm for flow-shop scheduling problems. In Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence (pp. 41-48). Springer Berlin Heidelberg.
Murata, T., Ishibuchi, H., & Tanaka, H. (1996). Genetic algorithms for flowshop scheduling problems. Computers & Industrial Engineering, 30(4), 1061-1071.
Nagano, M. S., & Moccellin, J. V. (2002). A high quality solution constructive heuristic for flow shop sequencing. Journal of the Operational Research Society, 53(12), 1374-1379.
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.
Nowicki, E., & Smutnicki, C. (1996). A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research, 91(1), 160-175.
Ogbu, F. A., & Smith, D. K. (1990). The application of the simulated annealing algorithm to the solution of the n/m/C max flowshop problem. Computers & Operations Research, 17(3), 243-253.
Onwubolu, G., & Davendra, D. (2006). Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research, 171(2), 674-692.
Osman, I. H., & Potts, C. N. (1989). Simulated annealing for permutation flow-shop scheduling. Omega, 17(6), 551-557.
Palmer, D. (1965). Sequencing jobs through a multi-stage process in the minimum total time--a quick method of obtaining a near optimum. OR, 101-107.
Pinedo, M. L. (2012). Scheduling: Theory, Algorithms, and Systems. Springer Science & Business Media.
Ponnambalam, S. G., Aravindan, P., & Chandrasekaran, S. (2001). Constructive and improvement flow shop scheduling heuristics: an extensive evaluation. Production Planning & Control, 12(4), 335-344.
Pour, H. D. (2001). A new heuristic for the n-job, m-machine flow-shop problem. Production Planning & Control, 12(7), 648-653.
Rajendran, C. (1993). Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics, 29(1), 65-73.
Reza Hejazi*, S., & Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research, 43(14), 2895-2929.
Ribas, I., & Mateo, M. (2010). Improvement tools for NEH based heuristics on permutation and blocking flow shop scheduling problems. In Advances in Production Management Systems. New Challenges, New Approaches (pp. 33-40). Springer Berlin Heidelberg.
Reeves, C. R. (1995). A genetic algorithm for flowshop sequencing. Computers & Operations Research, 22(1), 5-13.
Ronconi, D. P. (2004). A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics, 87(1), 39-48.
Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research,165(2), 479-494.
Sarin, S., & Lefoka, M. (1993). Scheduling heuristic for the n-jobm-machine flow shop. Omega, 21(2), 229-234.
Sayadi, M., 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.
Seman?o, P., & Modr?k, V. (2012). A Comparison of Constructive Heuristics with the Objective of Minimizing Makespan in the Flow-Shop Scheduling Problem. Acta Polytechnica Hungarica, 9(5).
Singhal, E., Singh, S., & Dayma, A. (2012). An Improved Heuristic for Permutation Flow Shop Scheduling. In NEH ALGORITHM). International Journal of Computational Engineering Research, 2(6), 95-100.
Suliman, S. M. A. (2000). A two-phase heuristic approach to the permutation flow-shop scheduling problem. International Journal of Production Economics,64(1), 143-152.
Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European journal of Operational research, 47(1), 65-74.
Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278-285.
Widmer, M., & Hertz, A. (1989). A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research, 41(2), 186-193.
Xiao-ping, L., Yue-Xuan, W., & Cheng, W. (2004, June). Heuristic algorithms for large flowshop scheduling problems. In Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on (Vol. 4, pp. 2999-3003). IEEE.
Yin, M., Zou, T., & Gu, W. (2010). Reverse Bridge Theorem under Constraint Partition. Mathematical Problems in Engineering, 2010.