A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers

被引:74
作者
Sambasivan, M [1 ]
Yahya, S [1 ]
机构
[1] Univ Putra Malaysia, Grad Sch Management, Serdang, Selangor, Malaysia
关键词
capacitated lot sizing; Lagrangean-based heuristic; multi-plant production planning;
D O I
10.1016/j.cor.2003.08.002
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper addresses scheduling of lot sizes in a multi-plant, multi-item, multi-period, capacitated environment with inter-plant transfers. A real-world problem in a company manufacturing steel rolled products provided motivation to this research. A Lagrangean-based approach, embedded with a lot shifting-splitting-merging routine, has been used for solving the multi-plant, capacitated lot-sizing problem. A "good" solution procedure developed by Sambasivan (Ph.D. Dissertation, University of Alabama, Tuscaloosa, 1994) has been used for solving the relaxed problem. About 120 randomly generated instances of the problem have been solved and it has been found that Lagrangean-based approach works quite "efficiently" for this problem. (C) 2003 Elsevier Ltd. All rights reserved.
引用
收藏
页码:537 / 555
页数:19
相关论文
共 33 条
[11]  
Finke DA, 2002, PROCEEDINGS OF THE 2002 WINTER SIMULATION CONFERENCE, VOLS 1 AND 2, P1013, DOI 10.1109/WSC.2002.1172994
[12]   The capacitated plant location problem with multiple facilities in the same site [J].
Ghiani, G ;
Guerriero, F ;
Musmanno, R .
COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (13) :1903-1912
[13]   A HEURISTIC ALGORITHM FOR THE MULTI-ITEM LOT-SIZING PROBLEM WITH CAPACITY CONSTRAINTS [J].
KARNI, R ;
ROLL, Y .
IIE TRANSACTIONS, 1982, 14 (04) :249-256
[14]   Unrelated parallel machine scheduling with setup times using simulated annealing [J].
Kim, DW ;
Kim, KH ;
Jang, W ;
Chen, FF .
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2002, 18 (3-4) :223-231
[15]   A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem [J].
Klose, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 126 (02) :408-421
[16]   New trends in parallel machine scheduling [J].
Lam, K ;
Xing, WX .
INTERNATIONAL JOURNAL OF OPERATIONS & PRODUCTION MANAGEMENT, 1997, 17 (3-4) :326-+
[17]   CAPACITY CONSTRAINED SINGLE-FACILITY DYNAMIC LOT-SIZE MODEL [J].
LAMBRECHT, M ;
VANDEREECKEN, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1978, 2 (02) :132-136
[18]   FACETS AND ALGORITHMS FOR CAPACITATED LOT SIZING [J].
LEUNG, JMY ;
MAGNANTI, TL ;
VACHANI, R .
MATHEMATICAL PROGRAMMING, 1989, 45 (02) :331-359
[19]   A modified genetic algorithm for single machine scheduling [J].
Liu, JY ;
Tang, LX .
COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 37 (1-2) :43-46
[20]   Simultaneous lotsizing and scheduling on parallel machines [J].
Meyr, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 139 (02) :277-292