W. Shen, Distributed manufacturing scheduling using intelligent agents, Intelligent Systems, vol.17, issue.1, pp.94-88, 2002.

W. Shen, Applications of agent-based systems in intelligent manufacturing: An updated review, Advanced Engineering Informatics, vol.20, issue.4, pp.415-431, 2006.
DOI : 10.1016/j.aei.2006.05.004

&. Lee and . Kim, Multi-agent systems applications in manufacturing systems and supply chain management: a review paper, International Journal of Production Research, vol.9, issue.1, pp.265-233, 2008.
DOI : 10.1007/978-3-642-60018-0_12

D. Ouelhadj and S. Petrovic, A survey of dynamic scheduling in manufacturing systems, Journal of Scheduling, vol.40, issue.3, pp.417-431, 2009.
DOI : 10.1023/A:1022235519958

E. Kutanoglu and S. D. Wu, On combinatorial auction and Lagrangean relaxation for distributed resource scheduling, IIE Transactions, vol.1, issue.9, pp.31-813, 1999.
DOI : 10.1007/BF00128881

M. P. Wellman, A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems, JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, vol.1, pp.1-23, 1993.

S. Rassenti, V. Smith, and R. Bulfin, A Combinatorial Auction Mechanism for Airport Time Slot Allocation, The Bell Journal of Economics, vol.13, issue.2, pp.417-402, 1982.
DOI : 10.2307/3003463

S. De-vries and R. V. Vohra, Combinatorial Auctions: A Survey, INFORMS Journal on Computing, vol.15, issue.3, pp.284-309, 2003.
DOI : 10.1287/ijoc.

P. Dewan and S. Joshi, Auction-based distributed scheduling in a dynamic job shop environment, International Journal of Production Research, vol.34, issue.5, pp.1173-1191, 2002.
DOI : 10.1080/09511929108944474

M. L. Fisher, The Lagrangian Relaxation Method for Solving Integer Programming Problems, Management Science, vol.50, issue.12_supplement, pp.1861-1871, 2004.
DOI : 10.1287/mnsc.1040.0263

N. A. Duffie, Synthesis of Heterarchical manufacturing systems, Computers in Industry, vol.14, issue.1-3, pp.167-174, 1990.
DOI : 10.1016/0166-3615(90)90118-9

C. A. Kaskavelis and M. C. Caramanis, Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems, IIE Transactions, vol.22, issue.11, pp.1085-1097, 1998.
DOI : 10.1109/9.668830

T. Sun, P. Luh, and M. Liu, Lagrangian relaxation for complex job shop scheduling. En Robotics and Automation, IEEE International Conference on, pp.1432-1437, 2006.

L. Tang, H. Xuan, and J. Liu, A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time, Computers & Operations Research, vol.33, issue.11, pp.3344-3359, 2006.
DOI : 10.1016/j.cor.2005.03.028

M. Ni, P. Luh, and B. Moser, An Optimization-Based Approach for Design Project Scheduling, Automation Science and Engineering IEEE Transactions on, vol.5, issue.3, pp.394-406, 2008.

J. Arauzo, Gestión eficiente de carteras de proyectos Propuesta de un sistema inteligente de soporte a la decisión para oficinas técnicas y empresas consultoras= efficient projet porfolio management. And intelligent decision system for engineering and consultancy firms, Dyna, vol.84, issue.9, pp.761-772, 2009.

A. M. Geoffrion, Lagrangean relaxation for integer programming. En Approaches to Integer Programming. págs, pp.82-114, 1974.
DOI : 10.1007/bfb0120690

M. Guignard, Lagrangean relaxation, Top, vol.4, issue.2, pp.151-200, 2003.
DOI : 10.1080/05695557808975181

P. M. Camerini, L. Fratta, and F. Maffioli, On improving relaxation methods by modified gradient techniques. En Nondifferentiable Optimization, INFORMATION TECHNOLOGY FOR BALANCED AUTOMATION SYSTEMS, pp.26-34, 1975.
DOI : 10.1007/bfb0120697

H. Crowder, Computational Improvements for Subgradient Optimization, Symposia Mathematica, pp.357-372, 1976.

U. Brännlund, A generalized subgradient method with relaxation step, Mathematical Programming, vol.22, issue.1, pp.207-219, 1995.
DOI : 10.1007/978-3-642-82118-9

J. Wang, An optimization-based algorithm for job shop scheduling, Sadhana, vol.41, issue.2, pp.241-256, 1997.
DOI : 10.1007/978-3-662-02796-7

X. Zhao, P. Luh, and J. Wang, The surrogate gradient algorithm for Lagrangian relaxation method. Decision and Control, Proceedings of the 36th IEEE Conference on, pp.310-305, 1997.

H. Chen and P. 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

X. Zhao, P. B. Luh, and J. Wang, Surrogate Gradient Algorithm for Lagrangian Relaxation, Journal of Optimization Theory and Applications, vol.38, issue.3, pp.699-712, 1999.
DOI : 10.1109/9.231461

URL : http://www.eng2.uconn.edu/msl/paper/xing/jota_10.pdf

X. Zhao and P. Luh, Fuzzy gradient method in Lagrangian relaxation for integer programming problems. En Decision and Control, Proceedings of the 37th IEEE Conference on. Decision and Control Proceedings of the 37th IEEE Conference on. págs, pp.3372-3377, 1998.

E. Demirkol, S. Mehta, and R. Uzsoy, Benchmarks for shop scheduling problems, European Journal of Operational Research, vol.109, issue.1, pp.137-141, 1998.
DOI : 10.1016/S0377-2217(97)00019-2

S. Kreipl, A large step random walk for minimizing total weighted tardiness in a job shop, Journal of Scheduling, vol.41, issue.3, pp.125-138, 2000.
DOI : 10.1007/BF02023076