Improvement of Lagrangian relaxation convergence for production scheduling

IEEE Transactions on Automation Science and Engineering

Volumn 9, Issue 1, 2012, Pages 137-147

  Buil, Roman ^a   Piera, Miquel Àngel ^a   Luh, Peter B ^b  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^b UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Constraint programming; Lagrangian relaxation (LR); Production planning; Scheduling

Indexed keywords

CONSTRAINT PROGRAMMING; CPU TIME; EXPERT USERS; INNOVATIVE APPROACHES; LAGRANGIAN RELAXATION; LAGRANGIAN RELAXATIONS; LR METHOD; MANUFACTURING SCHEDULING; NEW PRODUCTION; NP-HARD; OPTIMAL SOLUTIONS; PARAMETERS TUNING; PARAMETRIZATIONS; PRODUCTION PLANNING; PRODUCTION SCHEDULING; SCHEDULING PROBLEM; SET-UP TIME; STEP SIZE; SUBGRADIENT;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; FLEXIBLE MANUFACTURING SYSTEMS; LAGRANGE MULTIPLIERS; PRODUCTION CONTROL; PRODUCTION ENGINEERING; SCHEDULING;

PROBLEM SOLVING;

EID: 84855340493     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2011.2168817     Document Type: Article

References (10)

1. D. J. Hoitomt, P. B. Luh, and K. R. Pattipati, "A practical approach to job shop scheduling problems," IEEE Trans. Robot. Autom., vol. 9, no. 1, pp. 1-13, 1993.
2. T. Irohara, "Lagrangian relaxation algorithms for hybrid flow-shop scheduling problems with limited buffers," Int. J. Biomed. Soft Comput. Human Sci., vol. 15, no. 1, pp. 21-28, 2010.
3. M. Wallace, Constraint Programming, ser. The Handbook of Applied Expert Systems. Boca Raton, FL: CRC Press, 1998.
4. E. Tsang, Foundations of Constraint Satisfaction. San Diego, CA: Academic Press Limited, 1993.
5. R. Buil, P. B. Luh, and B. Xiong, "Synergy of lagrangian relaxation and constraint programming for manufacturing scheduling," in Proc. 6th World Congr. Intell. Control Autom., Jun. 2006, pp. 7410-7414. (Pubitemid 46540927)
6. J. Wang, P. B. Luh, X. Zhao, and J. Wang, "An optimization-based algorithm for job shop scheduling," SADHANA, J. Indian Acad. Sci., a Special Issue on Competitive Manufacturing Systems, vol. 22, no. 2, pp. 241-256, Apr. 1997.
7. H. Chen, P. B. Luh, and L. Fang, "A time-window based approach for job shop scheduling," in Proc. IEEE Conf. Robot. Autom., May 2001, pp. 842-847. (Pubitemid 32815308)
8. H. Chen, C. Chu, and J. M. Proth, "An improvement of the lagrangian relaxation approach for job shop scheduling: A dynamic programming method," IEEE Trans. Robot. Autom., vol. 14, no. 5, pp. 786-795, 1998. (Pubitemid 128743557)
9. X. Zhao, P. B. Luh, and J. Wang, "The surrogate gradient algorithm for lagrangian relaxation method," J. Opt. Theory Appl., vol. 100, no. 3, pp. 699-712, 1999.
10. S. Boyd, L. Xiao, and A. Mutapcic, "Subgradient methods," Oct. 2003. [Online]. Available: http://www.stanford.edu/class/ee392o/subgradmethod. pdf