COMPETITIVE METHODS FOR MULTILEVEL LOT-SIZING AND SCHEDULING - TABU SEARCH AND RANDOMIZED REGRETS

Authors
KIMMS A
Citation
A. Kimms, COMPETITIVE METHODS FOR MULTILEVEL LOT-SIZING AND SCHEDULING - TABU SEARCH AND RANDOMIZED REGRETS, International Journal of Production Research, 34(8), 1996, pp. 2279-2298
Citations number
35
Categorie Soggetti
Engineering,"Operatione Research & Management Science
Journal title
International Journal of Production Research → ACNP
ISSN journal
00207543
Volume
34
Issue
8
Year of publication
1996
Pages
2279 - 2298
Database
ISI
SICI code
0020-7543(1996)34:8<2279:CMFMLA>2.0.ZU;2-N
Abstract
This contribution presents two heuristic approaches for multi-level, s ingle-machine lot sizing and scheduling. The first one is a variant of a so-called randomized regret based heuristic which is assumed to be the fastest available method for this particular class of problems. Th e second approach is a tabu search technique that is competitive with respect to both the run-time performance and the average deviation fro m the optimum objective function values.