Lagrangian Relaxation algorithms for re-entrant hybrid flowshop scheduling

Proceedings of the International Conference on Information ManagementProceedings of the International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2008

Volumn 1, Issue , 2008, Pages 78-81

  Jiang, Shujun ^a   Tang, Lixin ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TIME; COMPUTATIONAL EXPERIMENTS; HYBRID FLOW SHOPS; HYBRID FLOWSHOP SCHEDULING; IDENTICAL PARALLEL MACHINES; LA-GRANGIAN RELAXATIONS; LAGRANGIAN MULTIPLIERS; NP-HARD; STRONGLY NP-HARD; SUB-GRADIENT OPTIMIZATIONS; SUB-PROBLEMS; SUBGRADIENT METHODS; TEST PROBLEMS; WEIGHTED COMPLETION TIME;

BUSINESS MACHINES; INDUSTRIAL ENGINEERING; INNOVATION; LAGRANGE MULTIPLIERS; SCHEDULING;

INFORMATION MANAGEMENT;

EID: 62949105379     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIII.2008.140     Document Type: Conference Paper

References (5)

1. W.L. Pearn, S.H. Chung, A.Y. Chen and M.H. Yang, "A case study on the multistage IC final testing scheduling problem with reentry," International Journal of Production Economics, 2004, Vol. 88, pp. 99-109.
2. S.W. Choi, Y.D. Kim and G.C. Lee, "Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop," International Journal of Production Research, 2005, Vol. 11, pp. 2149-2167.
3. X. Zhao, P.B. Luh and J. Wang, "Surrogate gradient algorithm for Lagrangian relaxation," Journal of Optimization Theory and Application, 1999, Vol. 100, pp. 699-712.
4. H.X. Chen and C.B. Chu, "A Lagrangian relaxation approach for supply chain planning with order/setup costs and capacity constraints," Journal of Systems Science and Systems Engineering, 2003, Vol. 12, No. 1, pp. 98-110.
5. C.A. Kaskavelis and M.C. Caramanis, "Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems," IIE Transactions, 1998, Vol. 30, pp. 1085-1097.