How to cite this paper
Sharma, M., Sharma, M & Sharma, S. (2021). An improved NEH heuristic to minimize makespan for flow shop scheduling problems.Decision Science Letters , 10(3), 311-322.
Refrences
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.
Bonney, M. C., & Gundry, S. W. (1976). Solutions to the constrained flowshop sequencing problem. Journal of the Operational Research Society, 27(4), 869-883.
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.
Chakraborty, U. K., & Laha, D. (2007). An improved heuristic for permutation flowshop scheduling. International Journal of Information and communication technology, 1(1), 89-97.
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.
Fernandez-Viagas, V., Ruiz, R., & Framinan, J. M. (2017). A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. European Journal of Operational Research, 257(3), 707-721.
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.
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, J. N. (1971). A functional heuristic algorithm for the flowshop scheduling problem. Journal of the Operational Research Society, 22(1), 39-47.
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.
Hundal, T. S., & Rajgopal, J. (1988). An extension of Palmer's heuristic for the flow shop scheduling problem. International Journal of Production Research, 26(6), 1119-1124.
Ignall, E., & Schrage, L. (1965). Application of the branch and bound technique to some flow-shop scheduling problems. Operations research, 13(3), 400-412.
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. (2009). An empirical analysis of the optimality rate of flow shop heuristics. European Journal of Operational Research, 198(1), 93-101.
Kalczynski, P. J., & Kamburowski, J. (2008). An improved NEH heuristic to minimize makespan in permutation flow shops. Computers & Operations Research, 35(9), 3001-3008.
King, J. R., & Spachis, A. S. (1980). Heuristics for flow-shop scheduling. International Journal of Production Research, 18(3), 345-357.
Koulamas, C. (1998). A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research, 105(1), 66-71.
Liu, W., Jin, Y., & Price, M. (2017). A new improved NEH heuristic for permutation flowshop scheduling problems. International Journal of Production Economics, 193, 21-30.
Nawaz, M., Enscore Jr, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91-95.
Onwubolu, G., & Davendra, D. (2006). Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research, 171(2), 674-692.
Page, E. S. (1961). An approach to the scheduling of jobs on machines. Journal of the Royal Statistical Society: Series B (Methodological), 23(2), 484-492.
Palmer, D. S. (1965). Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum. Journal of the Operational Research Society, 16(1), 101-107.
Rad, S. F., Ruiz, R., & Boroojerdian, N. (2009). New high performing heuristics for minimizing makespan in permutation flowshops. Omega, 37(2), 331-345.
Reza Hejazi*, S., & Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research, 43(14), 2895-2929.
Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2), 479-494.
Semanco, P., & Modrak, V. (2012). A comparison of constructive heuristics with the objective of minimizing makespan in the flow-shop scheduling problem. Acta Polytechnica Hungarica, 9(5), 177-190.
STINSON, J. P., & SMITH, A. W. (1982). A heuristic programming procedure for sequencing the static flowshop. The International Journal Of Production Research, 20(6), 753-764.
Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278-285.
Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational research, 47(1), 65-74.
Vallada, E., Ruiz, R., & Framinan, J. M. (2015). New hard benchmark for flowshop scheduling problems minimising makespan. European Journal of Operational Research, 240(3), 666-677.
Vasiljevic, D., & Danilovic, M. (2015). Handling ties in heuristics for the permutation flow shop scheduling problem. Journal of Manufacturing Systems, 35, 1-9.
Ying, K. C., & Lin, S. W. (2013). A high-performing constructive heuristic for minimizing makespan in permutation flowshops. Journal of Industrial and Production Engineering, 30(6), 355-362.
Bonney, M. C., & Gundry, S. W. (1976). Solutions to the constrained flowshop sequencing problem. Journal of the Operational Research Society, 27(4), 869-883.
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.
Chakraborty, U. K., & Laha, D. (2007). An improved heuristic for permutation flowshop scheduling. International Journal of Information and communication technology, 1(1), 89-97.
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.
Fernandez-Viagas, V., Ruiz, R., & Framinan, J. M. (2017). A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. European Journal of Operational Research, 257(3), 707-721.
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.
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, J. N. (1971). A functional heuristic algorithm for the flowshop scheduling problem. Journal of the Operational Research Society, 22(1), 39-47.
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.
Hundal, T. S., & Rajgopal, J. (1988). An extension of Palmer's heuristic for the flow shop scheduling problem. International Journal of Production Research, 26(6), 1119-1124.
Ignall, E., & Schrage, L. (1965). Application of the branch and bound technique to some flow-shop scheduling problems. Operations research, 13(3), 400-412.
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. (2009). An empirical analysis of the optimality rate of flow shop heuristics. European Journal of Operational Research, 198(1), 93-101.
Kalczynski, P. J., & Kamburowski, J. (2008). An improved NEH heuristic to minimize makespan in permutation flow shops. Computers & Operations Research, 35(9), 3001-3008.
King, J. R., & Spachis, A. S. (1980). Heuristics for flow-shop scheduling. International Journal of Production Research, 18(3), 345-357.
Koulamas, C. (1998). A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research, 105(1), 66-71.
Liu, W., Jin, Y., & Price, M. (2017). A new improved NEH heuristic for permutation flowshop scheduling problems. International Journal of Production Economics, 193, 21-30.
Nawaz, M., Enscore Jr, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91-95.
Onwubolu, G., & Davendra, D. (2006). Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research, 171(2), 674-692.
Page, E. S. (1961). An approach to the scheduling of jobs on machines. Journal of the Royal Statistical Society: Series B (Methodological), 23(2), 484-492.
Palmer, D. S. (1965). Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum. Journal of the Operational Research Society, 16(1), 101-107.
Rad, S. F., Ruiz, R., & Boroojerdian, N. (2009). New high performing heuristics for minimizing makespan in permutation flowshops. Omega, 37(2), 331-345.
Reza Hejazi*, S., & Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research, 43(14), 2895-2929.
Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2), 479-494.
Semanco, P., & Modrak, V. (2012). A comparison of constructive heuristics with the objective of minimizing makespan in the flow-shop scheduling problem. Acta Polytechnica Hungarica, 9(5), 177-190.
STINSON, J. P., & SMITH, A. W. (1982). A heuristic programming procedure for sequencing the static flowshop. The International Journal Of Production Research, 20(6), 753-764.
Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278-285.
Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational research, 47(1), 65-74.
Vallada, E., Ruiz, R., & Framinan, J. M. (2015). New hard benchmark for flowshop scheduling problems minimising makespan. European Journal of Operational Research, 240(3), 666-677.
Vasiljevic, D., & Danilovic, M. (2015). Handling ties in heuristics for the permutation flow shop scheduling problem. Journal of Manufacturing Systems, 35, 1-9.
Ying, K. C., & Lin, S. W. (2013). A high-performing constructive heuristic for minimizing makespan in permutation flowshops. Journal of Industrial and Production Engineering, 30(6), 355-362.