Publisher
Springer Nature Switzerland
Reference26 articles.
1. Kalczynski, P.J., Kamburowski, J.: On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega 35(1), 53–60 (2007)
2. Sauvey, C., Sauer, N.: Two NEH heuristic improvements for Flowshop scheduling problem with Makespan criterion. Algorithms 13(112), 1–14 (2020)
3. Liu, W., Jin, Y., Price, M.: A new improved NEH heuristic for permutation flowshop scheduling problems. Int. J. Prod. Econ. 193(June), 21–30 (2017)
4. Sharma, M., Sharma, M., Sharma, S.: An improved NEH heuristic to minimize makespan for flow shop scheduling problems. Decis. Sci. Lett. 10(3), 311–322 (2021)
5. Chen, C., Vempati, V.S., Aljaber, N.: An application of genetic algorithms for flow shop problems. Eur. J. Oper. Res. 80(2), 389–396 (1995)