References
- Blazewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., & Weglarz, J. (2007). Handbook on scheduling: From theory to applications. Berlin: Springer Science & Business Media.
- Billaut, J. C., Hebrard, E., & Lopez, P. (2012). Complete characterization of near-optimal sequences for the two-machine flow shop scheduling problem. In Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems (pp. 66–80). Berlin Heidelberg: Springer.10.1007/978-3-642-29828-8
- Briand, C., La, H. T., & Erschler, J. (2006). A new sufficient condition of optimality for the two-machine flowshop problem. European Journal of Operational Research, 169(3), 712–722.10.1016/j.ejor.2004.10.027
- Cheng, T. C. E. (1992). Efficient implementation of Johnson’s rule for the n/2/F/Fmax scheduling problem. Computers & Industrial Engineering, 22(4), 495–499.10.1016/0360-8352(92)90024-E
- Cheng, T. C. E., & Lin, B. M. T. (2017). Demonstrating Johnson’s algorithm via resource-constrained scheduling. International Journal of Production Research, 55(11), 3326–3330.10.1080/00207543.2017.1314040
- Grabowski, J., & Wodecki, M. (2004). A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers & Operations Research, 31(11), 1891–1909.10.1016/S0305-0548(03)00145-X
- Johnson, S. M. (1954). Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61–68.10.1002/(ISSN)1931-9193
- Kamburowski, J. (1997). The nature of simplicity of Johnson’s algorithm. Omega, 25(5), 581–584.10.1016/S0305-0483(97)00021-2
- Pinedo, M. (2002). Scheduling: Theory, algorithms, and systems. Prentice Hall.
- Sevastianov, S., & Lin, B. M. (2011). Efficient enumeration of optimal and approximate solutions of the two-machine flow-shop problem. In Preprint of 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (Nymburk, Czech Republic, July 19–24, 2007) (pp. 177–179).