Combine column generation with GUB to solve the steel-iron raw materials purchasing lot-sizing problem

Zidonghua Xuebao/Acta Automatica Sinica

Volumn 30, Issue 1, 2004, Pages 20-25

  Gao, Zhen ^a   Tang, Li Xin ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

Column generation; GUB; Lot sizing; Purchasing

Indexed keywords

ALGORITHMS; BOUNDARY ELEMENT METHOD; DECISION MAKING; IRON AND STEEL PLANTS; MATHEMATICAL MODELS; OPTIMIZATION; RAW MATERIALS;

COLUMN GENERATION; COST MINIMIZATION; GENERATED UPPER BOUNDS; INVENTORY COST; LOT SIZING PROBLEMS; PURCHASING COST;

PURCHASING;

EID: 2342566526     PISSN: 02544156     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. Derxl A, Kimms A. Lot-sizing and scheduling-Survey and extensions. European Journal of Operational Research, 1997, 99(2): 221-235
2. Kuik R, Salomon M, Van Wassenhove L N. Batch decisions: structure and models. European Journal of Operational Research, 1994, 75(2): 243-263
3. Macs J, Van Wassenhove L N. Multi-item single-level capacitated dynamic lot-sizing heuristics: A general review. Journal of the Operational Research Society, 1988, 39(11): 991-1004
4. Wang Zhao-Hui, Chen Hao-Xun, Hu Bao-Sheng. Scheduling for batch chemical processes using lagrangian relaxation-based approach. Acta Automatica Sinica, 1998, 24(1): 1-8 (in Chinese)
5. Wagner H M, Whitin T. Dynamic version of the economic lot-size model. Management Science, 1958, 5(1): 89-96
6. Manne A S. Programming of economic lot sizes. Management Science, 1958, 4(2): 115-135
7. Tang Li-Xin, Yang Zi-Hou, Wang Meng-Guang. Research on steelmaking and continuous casting production scheduling. Acta Automatica Sinica, 1998, 24(1): 9-15 (in Chinese)
8. Florian M, Lenstra J K, Rinnooy Kan A H G. Deterministic production planning: Algorithms and complexity. Management Science, 1980, 26(7): 12-20
9. Hindi K S. Solving the CLSP by a tabu search heuristics. Journal of the Operational Research Society, 1996, 47(1): 151-161
10. Dellaert D, Jeunet J, Jonard N. A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs. International Journal of Production Economics, 2000, 68(2): 241-257
11. Odamar L, Barbarosgou G. Hybrid heuristics for the multi-stage capacitated lot-sizing and loading problem. Journal of the Operational Research Society, 1999, 50(8): 810-825
12. Lasdon L S, Terjung R C. An efficient algorithm for multi-item scheduling. Operations Research, 1971, 19(4): 946-969
13. Dzielinski B P, Gomory R E. Optimal programming of lot-sizes, inventory and labor allocations. Management Science, 1965, 11(9): 874-890
14. Desrochers M, Desrosiers J, Soloman M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 1992, 40(2): 342-354
15. Savelsbergh M W P. A branch-and-price algorithm for the generalized assignment problem. Operations Research, 1997, 45(6): 831-841
16. Vance P H, Barnhart C, Johnson E L, Nemhauser G L. Airline crew scheduling: A new formulation and decomposition algorithm. Operations Research, 1997, 45(2): 188-200
17. Barnhart C, Hane C A, Vance P H. Using branch-and-price-and-cut to solve origin-destination integer multi-commodity flow problems. Operations Research, 2000, 48(2): 318-326
18. Barnhart C, Johnson E L, Nemhauser G L, Savelsbergh M W P, Vance P H. Branch-and-price: Column generation for solving huge integer programs. Operations Research, 1998, 46(3): 316-329
19. Yi Ting-Yuan, Liu Kun-Sheng. Industrial Accounting. Beijing: China Railway Press, 1990 (in Chinese)
20. Zhu Dao-Li. Large-scale systems optimization theory and application. Shanghai: Shanghai Jiaotong University Press, 1987 (in Chinese)
21. Gao Zhen, Tang Li-Xin. Branch-and-price algorithm of CLSP. Journal of Northeastern University, 2003, 24(1): 11-14 (in Chinese)