haku: @indexterm SEARCH PROBLEM / yhteensä: 29
viite: 6 / 29
| Tekijä: | Gopalakrishnan, M. |
| Otsikko: | A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover |
| Lehti: | Management Science
2001 : JUN, VOL. 47:6, p. 851-863 |
| Asiasana: | LOT-SIZE MODEL HEURISTIC METHODS SEARCH PROBLEM |
| Kieli: | eng |
| Tiivistelmä: | This paper presents a tabu-search heuristic for the capacitated lot-sizing problem (CLSP) with set-up carryover. This production-planning problems allow multiple items to be produced within a time period, and setups for items to be carried over from one period to the next. Two interrelated decisions, sequencing and lot sizing, are present in this problem. The authors' tabu-search heuristic consists of five basic move types-three for the sequencing decisions and two for the lot-sizing decisions. The authors allow infeasible solutions to be generated at a penalty during the course of the search. The authors use several search strategies, such as dynamic tabu list, adaptive memory, and self-adjusting penalties, to strengthen the authors' heuristic. |
SCIMA