A hierarchical Lagrangean relaxation procedure for solving midterm planning problems

Industrial and Engineering Chemistry Research

Volumn 38, Issue 5, 1999, Pages 1937-1947

  Gupta, Anshuman ^a   Maranas, Costas D ^a  

^a Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING; STRATEGIC PLANNING;

LAGRANGEAN RELAXATION;

PROCESS ENGINEERING;

ALGORITHM; ARTICLE; CHEMICAL INDUSTRY; COST CONTROL; INVENTORY CONTROL; PLANNING; PROBLEM SOLVING;

EID: 0032960899     PISSN: 08885885     EISSN: None     Source Type: Journal    
DOI: 10.1021/ie980782t     Document Type: Article

References (50)

1. Nemhauser, G. L.; Wolsey, L. A. Integer and Combinatorial Optimization; John Wiley: New York, 1988.
2. Wagner, H. M.; Whitin, T. M. Dynamic Version of the Economic Lot Size Model. Manage. Sci. 1958, 5, 89.
3. Bitran, G. R.; Yanasse, H. H. Computational Complexity of the Capacitated Lot-Sizing Problem. Manage. Sci. 1982, 28, 1174.
4. Florain, M.; Lenstra, J. K.; Kan, A. H. G. R. Deterministic Production Planning: Algorithms and Complexity. Manage. Sci. 1980, 26.
5. Barany, I.; Roy, T. J. V.; Wolsey, L. A. Strong Formulations for Multi-Item Capacitated Lot-Sizing. Manage. Sci. 1984, 30, 1255.
6. Leung, J. M. Y.; Magnanti, T. L.; Vachani, R. Facets and Algorithms for Capacitated Lot-Sizing. Math. Program. 1989, 45, 331.
7. Eppen, G. D.; Martin, R. K. Solving Multi-Item Capacitated Lot-Sizing Problems using Variable Redefinition. Oper. Res. 1987, 35, 832.
8. Bahl, H. C.; Zionts, S. Multi-Item Scheduling by Benders Decomposition. J. Oper. Res. Soc. 1987, 38, 1141.
9. Aardal, K.; Larsson, T. A Benders Decomposition Based Heuristic for the Hierarchical Production Planning Problem. Eur. J. Oper. Res. 1990, 45, 4.
10. DeSouza, K. X. S.; Armentano, V. A. Multi-Item Capacitated Lot-Sizing by a Cross Decomposition Based Algorithm. Ann. Oper. Res. 1994, 50, 557.
11. Graves, S. C. Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems. Manage. Sci. 1982, 28, 260.
12. Thizy, J. M.; Wassenhove, L. N. V. Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem: A Heuristic Implementation. IIE Trans. 1985, 17, 308.
13. Thizy, J. M. Analysis of Lagrangian Decomposition for the Multi-Item Capacitated Lot-Sizing Problem. INFOR 1991, 29, 271.
14. Diaby, M.; Bahl, H. C.; Karwan, M. H.; Zionts, S. A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing. Manage. Sci. 1992, 9, 1329.
15. Diaby, M.; Bahl, H. C.; Karwan, M. H.; Zionts, S. Capacitated Lot-Sizing and Scheduling by Lagrangean Relaxation. Eur. J. Oper. Res. 1992, 59, 444.
16. Millar, H. H.; Yang, M. An Application of Lagrangian Decomposition to the Multi-Item Lot-Sizing Problem. Comput. Oper. Res. 1993, 20, 409.
17. Hindi, K. S. Solving the Single-Item, Capacitated Dynamic Lot-Sizing Problem with Startup and Reservation Costs by Tabu Search. Comput. Ind. Eng. 1995, 28, 701.
18. Hindi, K. S. Solving the CLSP by a Tabu Search Heuristic. J. Oper. Res. Soc. 1996, 47, 151.
19. Sahinidis, N. V.; Grossmann, I. E.; Forni, R. E.; Chathrathi, M. Optimization Model for Long Range Planning in the Chemical Industry. Comput. Chem. Eng. 1989, 13, 1049.
20. Sahinidis, N. V.; Grossmann, I. E. Reformulation of Multiperiod MILP models for Planning and Scheduling of Chemical Processes. Comput. Chem. Eng. 1991, 15, 255.
21. Sahinidis, N. V.; Grossmann, I. E. Multiperiod Investment Model for Processing Networks with Dedicated and Flexible Plants. Ind. Eng. Chem. Res. 1991, 30, 1165.
22. Sahinidis, N. V.; Grossmann, I. E. Reformulation of the Multiperiod MILP Model for Capacity Expansion of Chemical Processes. Oper. Res. 1992, 40, S127.
23. Norton, L. C.; Grossmann, I. E. Strategic Planning Model for Complete Process Flexibility. Ind. Eng. Chem. Res. 1994, 33, 69.
24. Liu, M. L.; Sahinidis, N. V. Computational Trends and Effects of Approximation in an MILP Model for Process Planning. Ind. Eng. Chem. Res. 1995, 34, 1662.
25. Iyer, R. R.; Grossmann, I. E. A Bilevel Decomposition Algorithm for Long-Range Planning of Process Networks. Ind. Eng. Chem. Res. 1998, 37, 474.
26. Sahinidis, N. V.; Grossmann, I. E. MINLP Model for Cyclic Multiproduct Scheduling on Continuous Parallel Lines. Comput. Chem. Eng. 1991, 15, 85.
27. Shah, N.; Pantelides, C. C.; Sargent, R. W. H. A General Algorithm for Short-Term Scheduling of Batch Operations-2. Computational issues. Comput. Chem. Eng. 1993, 17, 229.
28. Zentner, Pekny, Reklaitis, and Gupta]zentner-etal:94 Zentner, M. G.; Pekny, J. F.; Reklaitis, G. V.; Gupta, J. N. D. Practical Considerations in Using Model-Based Optimization for the Scheduling and Planning of Batch/Semicontinuous Processes. J. Process Control 1994, 4, 259.
29. Papageorgiou, L. G.; Pantelides, C. C. Optimal Campaign Planning/Scheduling of Multipurpose Batch/Semicontinuous Plants. 1. Mathematical Formulation. Ind. Eng. Chem. Res. 1996, 35, 488.
30. Papageorgiou, L. G.; Pantelides, C. C. Optimal Campaign Planning/Scheduling of Multipurpose Batch/Semicontinuous Plants. 2. A Mathematical Decomposition Approach. Ind. Eng. Chem. Res. 1996, 35, 510.
31. Zhang, X.; Sargent, R. W. H. Optimal operation of mixed production facilities-a general formulation and some approaches for the solution. Comput. Chem. Eng. 1996, 20, 897.
32. Xueya, Z.; Sargent, R. W. H. Optimal operation of mixed production facilities-extensions and improvements. Comput. Chem. Eng. 1996, 20, S1287.
33. Karimi, I. A.; McDonald, C. M. Planning and Scheduling of Parallel Semicontinuous Processes. 2. Short-Term Scheduling. Ind. Eng. Chem. Res. 1997, 36, 2701.
34. Dimitriadis, A. D.; Shah, N.; Pantelides, C. C. RTN-Based Rolling Horizon Algorithms for Medium Term Scheduling of Multipurpose Plants. Comput. Chem. Eng. 1997, S21, S1061.
35. McDonald, C.; Karimi, I. A. Planning and Scheduling of Parallel Semicontinuous Processes. 1. Production Planning. Ind. Eng. Chem. Res. 1997, 36, 2691.
36. Liu, M. L.; Sahinidis, N. V. Long Range Planning in the Process Industries: A Projection Approach. Comput. Oper. Res. 1996, 23, 237.
37. Bassett, M. H.; Pekny, J. F.; Reklaitis, G. V. Decomposition Techniques for the Solution of Large-Scale Scheduling Problems. AIChE J. 1996, 42, 3373.
38. Schilling, G.; Pantelides, C. C. A simple continuous-time process scheduling formulation and a novel solution algorithm. Comput. Chem. Eng. 1996, 20, 1001.
39. Ierapetritou, M. G.; Floudas, C. A. Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes. Ind. Eng. Chem. Res. 1998, 37, 4341.
40. Ierapetritou, M. G.; Floudas, C. A. Effective continuous-time formulation for short-term scheduling. 1. Continuous and semicontinuous processes. Ind. Eng. Chem. Res. 1998, 37, 4360.
41. Benders, J. F. Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 1962, 4, 238.
42. Roy, T. J. V. Cross decomposition for mixed integer programming. Math. Program. 1983, 25, 46.
43. Fisher, M. L. The Lagrangian Relaxation Method for Solving Integer Programming Problems. Manage. Sci. 1981, 27, 1.
44. Fisher, M. L. An Application Oriented Guide to Lagrangian Relaxation. Interfaces 1985, 15, 10.
45. Geoffrion, A. M. Lagrangean relaxation and its uses in integer programming. Math. Program. Stud. 1974, 2, 82.
46. Guignard, M. Lagrangean Relaxation: A Short Course. Belg. J. Oper. Res. (Special Issue Francoro) 1995, 35 (3-4), 5-21.
47. Visweswaran, V. Decomposition techniques for MILP: Lagrangean relaxation. In Encyclopedia of Optimization; Floudas, C. A., Pardalos, P. M., Eds.; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1998.
48. Chen, W. H.; Thizy, J. M. Analysis of Relaxations for the Multi-Item Capacitated Lot-Sizing Problem. Ann. Oper. Res. 1990, 26, 29.
49. Bitran, G. R.; Matsuo, H. The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations. Manage. Sci. 1986, 32, 350.
50. Brooke, A; Kendrick, D.; Meeraus, A. GAMS: A User's Guide; Scientific Press: Palo Alto, CA, 1988.