.png){kind=icon}
返回
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
.png){kind=icon}
OA
AI
DOI：10.1016/S0305-0548(98)00089-6.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keyword:
multi-level lot sizing
scheduling
genetic algorithms
PLSP
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
