References
- Haouari, M., & Kharbeche, M. (2013). An assignment-based lower bound for a class of two-machine flow shop problems. Computers & Operations Research, 40(7), 1693–1699. https://doi.org/10.1016/j.cor.2013.01.001
- Kharbeche, M., & Haouari, M. (2013). MIP models for minimizing total tardiness in a two-machine flow shop. Journal of the Operational Research Society, 64(5), 690–707. https://doi.org/10.1057/jors.2012.89
- Lenstra, J. K., Kan, A. R., & Brucker, P. (1977). Complexity of machine scheduling problems. In Annals of discrete mathematics (Vol. 1, pp. 343–362). Elsevier.
- Pan, J. C.-H., Chen, J.-S., & Chao, C.-M. (2002). Minimizing tardiness in a two-machine flow-shop. Computers & Operations Research, 29(7), 869–885. https://doi.org/10.1016/S0305-0548(00)00090-3
- Pan, J. C.-H., & Fan, E.-T. (1997). Two-machine flowshop scheduling to minimize total tardiness. International Journal of Systems Science, 28(4), 405–414. https://doi.org/10.1080/00207729708929401