A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover

References

• Anderson E. J., Cheah B. S. Capacitated lot-sizing with minimum batch sizes and setup times. Internat. J. Production Econom. (1993) 30–31:137–152Crossref, Google Scholar
• Aras O. A., Swanson L. A. A lot sizing and sequencing algorithm for dynamic demands upon a single facility. J. Oper. Management. (1982) 2:177–185Crossref, Google Scholar
• Cattrysse D., Salomon M., Kuik R., Van Wassenhove L. N. A dual ascent and column generation heuristic for the discrete lot sizing and scheduling problem with setup times. Management Sci. (1993) 39:477–486Link, Google Scholar
• Dell'Amico M., Trubian M. Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. (1993) 41:231–252Crossref, Google Scholar
• Diaby M., Bahl H. C., Karwan M. H., Zionts S. A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Management Sci. (1992) 38:1329–1340Link, Google Scholar
• Florian M., Lenstra J. K., Rinnooy Kan A. H. G. Deterministic production planning: algorithms and complexity. Management Sci. (1980) 26:669–679Link, Google Scholar
• Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Sci. (1994) 40:1276–1290Link, Google Scholar
• Glover F., Laguna M., Reeves C. Tabu search. Modern Heuristic Techniques for Combinatorial Problems (1993) (Blackwell Scientific Publications, Oxford, U.K.) 70–150Google Scholar
• Glover F., Kochenberger G., Alidaee B. Adaptive memory tabu search. Management Sci. (1998) 44:336–345Link, Google Scholar
• Glover F., Taillard E., de Werra D. A users guide to tabu search. Ann. Oper. Res. (1993) 41:3–28Crossref, Google Scholar
• Gopalakrishnan M. A modified framework for modeling setup carryover in the capacitated lotsizing problem. Internat. J. Production Res. (2000) 38:3421–3424Crossref, Google Scholar
• Gopalakrishnan M., Miller D. M., Schmidt C. P. A framework for modeling setup carryover in the capacitated lot sizing problem. Internat. J. Production Res. (1995) 33:1973–1988Crossref, Google Scholar
• Hertz A., Taillard E., de Werra D., Aarts E., Lenstra J.K. Tabu search. Local Search in Combinatorial Optimization (1997) (John Wiley & Sons, New York) 121–136Google Scholar
• Lozano S., Larraneta J., Onieva L. Primal-dual approach to the single level capacitated lot-sizing problem. Euro. J. Oper. Res. (1991) 51:354–366Crossref, Google Scholar
• Rochat Y., Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1:147–167Crossref, Google Scholar
• Salomon M., Kuik R., Van Wassenhove L. N. Statistical search methods for lotsizing problems. Ann. Oper. Res. (1993) 41:453–468Crossref, Google Scholar
• Trigeiro W. W., Thomas L. J., McClain J. O. Capacitated lot sizing with setup times. Management Sci. (1989) 35:353–366Link, Google Scholar
• Wagner H. M., Whitin T. M. Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96Link, Google Scholar