Article ID: | iaor20002065 |
Country: | United Kingdom |
Volume: | 26 |
Issue: | 8 |
Start Page Number: | 829 |
End Page Number: | 848 |
Publication Date: | Jul 1999 |
Journal: | Computers and Operations Research |
Authors: | Kimms A. |
Keywords: | production: MRP, heuristics |
This contribution introduces a mixed-integer programming formulation for the multi-level, multi-machine proportional lot sizing and scheduling problem. It also presents a genetic algorithm to solve that problem. The efficiency of that algorithm is due to an encoding of solutions which uses a two-dimensional matrix representation with non-binary entries rather than a simple bitstring. A computational study reveals that the proposed procedure works amazingly fast and competes with a tabu search approach that has recently been published.