A splitting-up approach to simplify job-shop scheduling problems
作者:
C. Chu,
M. C. Portmann,
J. M. Proth,
期刊:
International Journal of Production Research
(Taylor Available online 1992)
卷期:
Volume 30,
issue 4
页码: 859-870
ISSN:0020-7543
年代: 1992
DOI:10.1080/00207543.1992.9728461
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
In this paper we propose a scheduling algorithm based on splitting up the problem into separate yet linked subproblems. We develop a heuristic algorithm to manage the remaining links between the scheduling subproblems obtained as a result of the splitting process. The complexity of the computation and the performance of the algorithms are examined and numerical examples are given to illustrate these algorithms.
点击下载:
PDF (769KB)
返 回