Title :
Effective and efficient solution of some lot-sizing problems by tabu search
Author_Institution :
Dept. of Comput., Univ. of Manchester Inst. of Sci. & Technol., UK
Abstract :
The paper demonstrates that the power of tabu search enables it to play a useful role in the solution of difficult planning and scheduling problems. The solution of two such problems; namely, the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs and the multi-item, single-level, capacitated, dynamic lot-sizing problem, is presented
Keywords :
computational complexity; production control; search problems; efficient solution; lot-sizing problems; multi-item single-level capacitated dynamic lot-sizing problem; planning problems; reservation costs; scheduling problems; single-item capacitated dynamic lot-sizing problem; startup costs; tabu search; Continuous production; Costs; Iterative methods; Job shop scheduling; Lot sizing; Processor scheduling; Production facilities; Production planning; Productivity; Search methods;
Conference_Titel :
Emerging Technologies and Factory Automation, 1995. ETFA '95, Proceedings., 1995 INRIA/IEEE Symposium on
Conference_Location :
Paris
Print_ISBN :
0-7803-2535-4
DOI :
10.1109/ETFA.1995.496782
