C. Akkan and S. Karabati, The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm, European Journal of Operational Research, vol.159, issue.2, pp.420-429, 2004.
DOI : 10.1016/S0377-2217(03)00415-6

B. W. Cadambi and Y. S. Sathe, Two-machine flowshop scheduling to minimize mean flow time, Opsearch, vol.30, issue.1, pp.35-41, 1993.

R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling, 1967.

F. Della-croce, V. Narayan, and R. Tadei, The two-machine total completion time flow shop problem, European Journal of Operational Research, vol.90, issue.2, pp.227-237, 1996.
DOI : 10.1016/0377-2217(95)00351-7

B. Detienne, S. Dauzère-pérès, and C. Yugma, An exact approach for scheduling jobs with regular step cost functions on a single machine, Computers & Operations Research, vol.39, issue.5, pp.1033-1043, 2012.
DOI : 10.1016/j.cor.2011.06.006
URL : https://hal.archives-ouvertes.fr/emse-00613039

M. R. Garey, D. S. Johnson, and R. Sethi, The Complexity of Flowshop and Jobshop Scheduling, Mathematics of Operations Research, vol.1, issue.2, pp.117-129, 1976.
DOI : 10.1287/moor.1.2.117

A. Gharbi, T. Ladhari, M. K. Msakni, and M. Serairi, The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies, European Journal of Operational Research, vol.231, issue.1, pp.69-78, 2013.
DOI : 10.1016/j.ejor.2013.05.031

T. Ibaraki and Y. Nakamura, A dynamic programming method for single machine scheduling, European Journal of Operational Research, vol.76, issue.1, pp.72-82, 1994.
DOI : 10.1016/0377-2217(94)90007-8

S. Tanaka, Extension of the Dynasearch to the Two-Machine Permutation Flowshop Scheduling Problem, Proceedings of the 2010 International Symposium on Flexible Automation, p.6, 2010.
DOI : 10.5687/iscie.24.23

S. L. Van-de-velde, Minimizing the sum of the job completion times in the two-machine flow shop by lagrangian relaxation, Annals of Operations Research, pp.257-268, 1990.