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

Aras OA. A heuristic solution procedure for a single-facility multi-item dynamic lot-sizing and sequencing problem. PhD dissertation, Syracuse University, 1981. Barany, 1984, Uncapacitated lot-sizing, Mathematical Programming Study, 22, 32, 10.1007/BFb0121006 Barany, 1984, Strong formulations for multi-item capacitated lot-sizing, Management Science, 30, 1255, 10.1287/mnsc.30.10.1255 Pochet, 1988, Valid inequalities and separation for capacitated economic lot-sizing, Operations Research Letters, 7, 109, 10.1016/0167-6377(88)90076-4 Leung, 1989, Facets and algorithms for capacitated lot-sizing, Mathematical Programming, 45, 331, 10.1007/BF01589110 Eppen, 1987, Solving multi-item capacitated lot-sizing problems using variable redefinition, Operations Research, 35, 832, 10.1287/opre.35.6.832 Eisenhut, 1975, A dynamic lot-sizing algorithm with capacity constraints, AIIE Transactions, 7, 170, 10.1080/05695557508974999 Dixon, 1981, A heuristic solution procedure for the multi-item, single-level, limited capacity lot-sizing problem, Journal of Operations Management, 2, 23, 10.1016/0272-6963(81)90033-4 Lambrecht, 1978, A capacity-constrained single-facility dynamic lot size model, European Journal of Operations Research, 2, 132, 10.1016/0377-2217(78)90109-1 Karni, 1982, A heuristic algorithm for the multi-item lot-sizing problem with capacity constraints, IIE Transactions, 14, 249 Trigerio, 1989, Capacitated lot-sizing with setup times, Management Science, 35, 353, 10.1287/mnsc.35.3.353 Wagner, 1958, Dynamic version of economic lot size model, Management Science, 5, 89, 10.1287/mnsc.5.1.89 Chen, 1990, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Annals of Operations Research, 26, 29, 10.1007/BF02248584 Sambasivan, 2002, A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems, Asia-Pacific Journal of Operational Research, 19, 87 Ghiani, 2002, The capacitated plant location problem with multiple facilities in the same site, Computers & Operations Research, 29, 1903, 10.1016/S0305-0548(01)00065-X Özdamar, 2000, An integrated Lagrangean relaxation-simulated annealing approach to the multi-level multi-item capacitated lot-sizing problem, International Journal of Production Economics, 68, 319, 10.1016/S0925-5273(99)00100-0 Klose, 2000, A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem, European Journal of Operational Research, 126, 408, 10.1016/S0377-2217(99)00300-8 Sambasivan M. Uncapacitated and capacitated lot-sizing for multi-plant, multi-item, multi-period problems with inter-plant transfers. PhD dissertation, University of Alabama, Tuscaloosa, 1994. Bitran, 1982, Computational complexity of the capacitated lot size problem, Management Science, 28, 1174, 10.1287/mnsc.28.10.1174 Mokotoff, 2001, Parallel machine scheduling problems, Asia-Pacific Journal of Operational Research, 18, 193 Chen, 1999, A column generation based decomposition approach for parallel machine just-in-time scheduling problem, European Journal of Operational Research, 116, 220, 10.1016/S0377-2217(98)00136-2 Mokotoff E. An exact algorithm for the identical parallel machine scheduling problem. European Journal of Operational Research 2003, to appear. PII:S0377-2217(02)00726-9. Lam, 1997, New trends in parallel machine scheduling, International Journal of Production & Operations Management, 17, 326, 10.1108/01443579710159932 Finke DA, Medeiros DJ, Traband MT. Shop scheduling using Tabu search and simulation. Proceedings of the 2002 Winter Simulation Conference. 2002. p. 1013–7. Sevaux M, Thomin P. Heuristics and metaheuristics for a parallel machine scheduling problem: a computational evaluation. Research Report 01-2-SP, University of Valenciennes, 2001. Kim, 2002, Unrelated parallel machine scheduling with setup times using simulated annealing, Robotics and Computer Integrated Manufacturing, 18, 223, 10.1016/S0736-5845(02)00013-3 Azizoglu, 1999, Scheduling jobs on unrelated parallel machines to minimize regular cost function, IIE Transactions, 31, 153, 10.1080/07408179908969814 Mokotoff, 2002, A cutting plane algorithm for parallel unrelated machine scheduling problem, European Journal of Operational Research, 141, 515, 10.1016/S0377-2217(01)00270-3 Turkcan, 2003, Nonidentical parallel CNC machine scheduling, International Journal of Production Research, 41, 2143, 10.1080/0020754031000087184 Muller FM, Camozzoto MM, Araujo OCB. Neighbourhood constraint for a Tabu search algorithm to schedule jobs on unrelated parallel machines. MIC2001—Fourth Metaheuristics International Conference 2001. p. 551–5. Tardos, 1985, A strongly polynomial minimum cost circulation algorithm, Combinatorica, 5, 247, 10.1007/BF02579369 Liu, 1999, A modified genetic algorithm for single machine scheduling, Computers & Industrial Engineering, 37, 43, 10.1016/S0360-8352(99)00020-0 Meyr, 2002, Simultaneous lotsizing and scheduling on parallel machines, European Journal of Operational Research, 139, 277, 10.1016/S0377-2217(01)00373-3