期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 57, 期 3, 页码 766-772出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2009.02.004
关键词
Complex product flexible scheduling; Improved processing operation tree; Short-time strategy; Machine-balance strategy; Forward greedy rule
资金
- National Natural Science Foundation of China [60873019, 50575062]
- Natural Science Foundation of Heilongjiang Province of China [F200608]
- Heilongjiang Provincial Education Department of China [1152hq08]
In order to simplify the complex product flexible scheduling problem with constraint between jobs, a new hierarchical scheduling algorithm based on improved processing operation tree is presented. Aiming at the routing problem, short-time strategy and machine-balance strategy are adopted to assign each operation to a machine out of a set of machines. And in order to solve the sequencing problem, the allied critical path method is first adopted to confirm the scheduling sequence of operations, and then operations are divided into dependent operations and independent ones according to their characteristics. For the dependent operations, forward greedy rule is adopted in order to make the completion time of operation as soon as possible and the scheduling algorithm of shortening idle time is adopted by analyzing the characteristics of the independent operations. Experiment shows that the proposed algorithm solves for the first time the complex product flexible scheduling problem with constraint between jobs. (C) 2009 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据