Solving the CLSP by a tabu search heuristic

Journal of the Operational Research Society

Volumn 47, Issue 1, 1996, Pages 151-161

  Hindi, K S ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Capacitated lot sizing; Network flows; Production planning; Tabu search

Indexed keywords

HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; INVENTORY CONTROL; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPERATIONS RESEARCH; PROBLEM SOLVING;

MINIMUM COST NETWORK FLOW PROBLEM; SINGLE LEVEL CAPACITATED DYNAMIC LOT SIZING PROBLEM; TABU SEARCH METHOD;

PRODUCTION CONTROL;

EID: 0029733788     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.13     Document Type: Article

References (35)

1. G. R. Bitran and H. H. Yanasse (1982) Computational complexity of the capacitated lot size problem. Mgmt Sci. 28, 1174-1186.
2. M. Florian, J. K. Lenstra and A. H. G. Rinnooy Kan (1980) Deterministic production planning: algorithms and complexity. Mgmt Sci. 26, 669-679.
3. D. Cattrysse, J. Maes and L. Wassenhove (1990) Set partitioning and column generation heuristic for capacitated dynamic lotsizing. Eur. J. Opl Res. 46, 38-47.
4. J. Maes and L. N. Van Wassenhove (1988) Multi-item single-level capacitated dynamic lotsizing heuristic: a general review. J. Opl Res. Soc. 39, 991-1004.
5. P. S. Dixon and E. A. Silver (1981) A heuristic solution procedure for the multi-item, single level, limited capacity, lot sizing problem. J. Opns Mgmt. 2, 23-39.
6. P. S. Eisenhut (1975) A dynamic lotsizing algorithm with capacity constraints. AIIE Trans. 7, 170-176.
7. M. R. Lambrecht and H. Vanderveken (1979) Heuristic procedures for the single operation, multi-item loading problem. AIIE Trans. 11, 319-326.
8. A Dogramaci, J. E. Pansyiotopoulos and N. R. Adam (1981) The dynamic lot-sizing problem for multiple items under limited capacity. AIIE Trans. 13, 294-303.
9. R. Karni and Y. Roll (1982) A heuristic algorithm for the multi-item lot sizing problem with capacity constraints. HE Trans. 14, 249-256.
10. E. F. P. Newson (1975) Multi-item lot-size scheduling by heuristic, part I: with fixed resources. Mgmt Sci. 21, 1186-1193.
11. E. F. P. Newson (1975) Multi-item lot size scheduling by heuristic, part II: with variable resources. Mgmt Sci. 21, 1194-1203
12. L. F. Gelders, J. Maes and L. N. Van Wassenhove (1986) A branch and bound algorithm for the multi item single level capacitated dynamic lot sizing. In Multi Stage Production Planning and Inventory. Control. (S. Axsater et al., Eds) pp. 92-108. Springer Verlag, Berlin.
13. H. M. Wagner and T. M. Whitin (1958) Dynamic version of the economic lot-sizing model. Mgmt Sci. 5, 89-96.
14. R. Kipp Martin (1987) Generating alternative mixed-integer programming models using variable redefinition. Opns Res. 35, 820-831.
15. G. D. Eppen and R. Kipp Martin (1987) Solving multi-item capacitated lot sizing problems using variable redefinition. Opns Res. 35, 832-848.
16. A. I. Ali, R. Padman and H. Thiagarajan (1989) Dual algorithms for pure network problems. Opns Res. 37, 158-171.
17. D. Bertsekas and P. Tseng (1988) Relaxation methods for minimum cost ordinary and generalized network flow problems. Opns Res. 36, 93-114.
18. M. D. Grigoriadis (1986) An efficient implementation of the network simplex method. Math. Prog. Study. 26, 83-111.
19. K. S. Hindi (1993) Efficient implementation of network simplex algorithms. DTG Report. 93:3 (update of DTG report 87:7), Department of Computation, UMIST.
20. F. Glover (1989) Tabu search—part 1. ORSA J. Computing. 1, 190-206.
21. F. Glover (1990) Tabu search—part 2. ORSA J. Computing. 2, 4-32.
22. P. Hansen (1986) The steepest ascent mildest descent heuristic for combinational programming. Presented at the Congress on Numerical Methods in Combinatorial Programming., Capri, Italy.
23. F. Glover and M. Laguna (1993) Tabu search. In Modern Heuristic Techniques in Combinatorial Problems. (C. R. Reeves, Ed.) pp. 70-150. Blackwell, Oxford.
24. C. R. Reeves (1993) Improving the efficiency of tabu search for machine sequencing problems. J. Opl. Res. Soc. 44, 375-382.
25. M. L. Fisher (1981) The Lagrangean relaxation method for solving integer programming problems. Mgmt Sci. 27, 1-18.
26. A. M. Geoffrion (1974) Lagrangean relaxation of integer programming. Math. Prog. Study. 2, 82-114.
27. J. M. Thizy and L. N. Van Wassenhove (1985) Lagrangean relaxation for the multi-item capacitated lotsizing problem: a heuristic approach. AIIE Trans. 17, 308-313.
28. E. H. Bowman (1965) Production scheduling by the transportation method of linear programming. Opns Res. 4, 100-103.
29. A. S. Manne (1958) Programming of economic lot sizes. Mgmt Sci. 4, 115-135.
30. B. P. Dzielinski and R. E. Gomory (1965) Optimal programming of lot sizes, inventory and labor allocations. Mgmt Sci. 11, 874-890.
31. L. S. Lasdon and R. C. Terjung (1971) An efficient algorithm for multi-item scheduling. Opns Res. 19, 946-969.
32. H. C. Bahl (1983) Column generation based heuristic algorithm for multi-item scheduling. HE Trans. 15, 136-141.
33. H. C. Bahl and L. P. Ritzman (1984) A cyclical scheduling heuristic for lotsizing with capacity constraints. Int. J. Prod. Res. 22, 791-800.
34. G. R. Bitran and H. Matsuo (1991) The multi-item capacitated lot size problem: error bounds of Manne’s formulations. Mgmt Sci. 32, 350-358.
35. W. Trigeiro, J. Thomas and J. McClain (1989) Capacitated lot sizing with set-up times. Mgmt Sci. 35, 353-366.