J. Carlier and E. Pinson, An Algorithm for Solving the Job-Shop Problem, Management Science, vol.35, issue.2, pp.164-176, 1989.
DOI : 10.1287/mnsc.35.2.164

J. Carlier and E. Pinson, Adjustment of heads and tails for the job-shop problem, European Journal of Operational Research, vol.78, issue.2, pp.146-161, 1994.
DOI : 10.1016/0377-2217(94)90379-4

H. Chen, C. Chu, and J. Proth, An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming method, IEEE Transactions on Robotics and Automation, vol.14, issue.5, pp.786-795, 1998.
DOI : 10.1109/70.720354

H. Chen and P. B. Luh, An alternative framework to Lagrangian relaxation approach for job shop scheduling, European Journal of Operational Research, vol.149, issue.3, pp.499-512, 2003.
DOI : 10.1016/S0377-2217(02)00470-8

A. G. Santos, R. P. Araujo, and J. E. Arroyo, A Combination of Evolutionary Algorithm, Mathematical Programming, and a New Local Search Procedure for the Just-In-Time Job-Shop Scheduling Problem, Lecture Notes in Computer Science, vol.6073, pp.10-24, 2010.
DOI : 10.1007/978-3-642-13800-3_2

G. Lancia, F. Rinaldi, and P. Serafini, A time-indexed LP-based approach for min-sum job-shop problems, Annals of Operations Research, vol.35, issue.1, pp.175-198, 2011.
DOI : 10.1007/s10479-010-0832-9

J. N. Monette, Y. Deville, and P. Van-hentenryck, Just-in-time scheduling with constraint programming, Proceedings of the 19th International Conference on Automation Planning and Scheduling (ICAPS'09), pp.241-248, 2009.

H. D. Sherali and O. Ulular, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Applied Mathematics & Optimization, vol.3, issue.1, pp.193-221, 1989.
DOI : 10.1007/BF01447654

M. Singer and M. Pinedo, A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops, IIE Transactions, vol.16, issue.2, pp.109-118, 1998.
DOI : 10.1080/00207547608956596

F. Sourd and S. Kedad-sidhoum, The one-machine problem with earliness and tardiness penalties, Journal of Scheduling, vol.6, issue.6, pp.533-549, 2003.
DOI : 10.1023/A:1026224610295

S. Tanaka, S. Fujikuma, and M. Araki, An exact algorithm for single-machine scheduling without??machine idle time, Journal of Scheduling, vol.12, issue.6, pp.575-593, 2009.
DOI : 10.1007/s10951-008-0093-5

S. Tanaka and S. Fujikuma, A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time, Journal of Scheduling, vol.5, issue.3, pp.347-361, 2012.
DOI : 10.1007/s10951-011-0242-0

S. Wang and Y. Li, Variable neighborhood search and mathematical programming for just-in-time jobshop scheduling problem, Mathematical Problems in Engineering, vol.2014, p.431325, 2014.

. P. Wolfe, A method of conjugate subgradients for minimizing nondifferentiable functions, Mathematical Programming Study, vol.3, pp.145-173, 1975.
DOI : 10.1007/BFb0120703