MRP-production planning in agile manufacturing

2004 2nd International IEEE Conference 'Intelligent Systems' - Proceedings

Volumn 2, Issue , 2004, Pages 405-410

  Le, Vu T ^a   Gunn, Bruce M ^a   Nahavandi, Saeid ^a  

^a DEAKIN UNIVERSITY   (Australia)

Author keywords

Lot sizing; Multi item; Multi period; Production planning

Indexed keywords

ALGORITHMS; COSTS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; STRATEGIC PLANNING;

LOT-SIZING; MULTI-ITEM; MULTI-PERIOD; PRODUCTION PLANNING;

PRODUCTION ENGINEERING;

EID: 10044295038     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. H.M. Wagner and T.M. Whitin, "Dynamic version of the economic lot size model", Management Science, vol. 5, pp 89-96, 1958.
2. A. Aggarwal and J.K. Park. Improved algorithms for economic lot-size problems. Operations Research, vol. 41, no. 3, pp. 549-571, 1993.
3. Federgruen, A. and M, Tzur. "A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in O(nlogn) or O(n) Time." Management Science, vol. 37, pp. 909-925, 1991
4. A. Wagelmans, S. van Hoesel, and A. Kolen. "Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Within case." Operations Research, vol. 40, no. 1, pp. S145-S156, 1992.
5. M. Florian, J.K. Lenstra, and A.H.G. Rinnooy Kan. "Deterministic production planning: algorithms and complexity." Management Science, vol. 26, no. 7, pp. 669-679, 1980.
6. G.R. Bitran and H.H. Yanasse. "Computational complexity of the capacitated lot size problem." Management Science, vol. 28, no. 10, pp. 1174-1186, 1982.
7. M. Florian, J.K. Lenstra, and A.H.G. Rinnooy Kan. "Deterministic production planning: algorithms and complexity." Management Science, vol. 26, no. 7, pp. 669-679, 1980.
8. C.P.M. van Hoesel and A.P.M. Wagelmans. "An O(T3) algorithm for the economic lot-sizing problem with constant capacities." Management Science, vol. 42, no. 1, pp. 142-150, 1996.
9. S.S Erenguc and Y. Aksoy. "A Branch and Bound Algorithm for a Single Item Nonconvex Dynamic Lot Sizing Problem with Capacity Constraints." Computers and Operations Research, vol. 17, pp. 199-210, 1990.
10. H.D. Chen, D. Hearn and C.Y. Lee. "A New Dynamic Programming Algorithm for the Single Item Capacitated Dynamic Lot Size Model." Journal of Global Optimization, vol. 4, pp. 285-300, 1994a.
11. W.W. Trigiero, L.J. Thomas, and J.O. McClain. "Capacitated lot-sizing with setup times." Management Science, vol. 35, pp. 353-366, 1989.
12. H. Tempelmeier and M. Derstro®. "A lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times." Management Science, vol. 42, pp. 738-757, 1996.
13. G. Belvaux and L.A. Wolsey. "BC-Prod: a specialized branch-and-cut system for lot-sizing problems." Management Science, vol. 46, pp. 724-738, 2000.
14. Y. Pochet and L.A. Wolsey. "Solving multi-item lot-sizing problems using strong cutting planes." Management Science, vol. 37, pp. 53-67, 199