| Flow shop rescheduling problem under rush orders |
| |
| 作者姓名： | 胡燕海 严隽琪 叶飞帆 于军合 |
| |
| 作者单位： | Faculty of Engineering，Ningbo University，Ningbo 315211，China，Institute of CIM，Shanghai Jiao Tong University，Shanghai 200030，China，Institute of CIM，Shanghai Jiao Tong University，Shanghai 200030，China，Faculty of Engineering，Ningbo University，Ningbo 315211，China，Faculty of Engineering，Ningbo University，Ningbo 315211，China |
| |
| 基金项目： | 国家自然科学基金，浙江省自然科学基金，Ningbo Municipal Youth Foundation |
| |
| 摘 要： | INTRODUCTION Rescheduling problem in manufacturing system is considered as a particularly hard combinatorial optimization problem,closely related with uncer-tainty caused by exterior business environment and interior production conditions.Production resched-uling is a common practice in manufacturing compa-nies all over the world.Four sources of production disturbances have been identified:(1)incorrect work;(2)machine breakdowns;(3)rework due to quality problem;and(4)rush orders(Rangsarit…
|
| 关 键 词： | 最优化标准 动态时序安排 群体优化 突变操作 |
| 收稿时间： | 2005-02-27 |
| 修稿时间： | 2005-04-26 |
Flow shop rescheduling problem under rush orders |
| |
| Hu Yan-hai,Yan Jun-qi,Ye Fei-fan,Yu Jun-he.Flow shop rescheduling problem under rush orders[J].Journal of Zhejiang University Science,2005,6(10):1040-1046. |
| |
| Authors: | Hu Yan-hai Yan Jun-qi Ye Fei-fan Yu Jun-he |
| |
| Institution: | (1) Faculty of Engineering, Ningbo University, 315211 Ningbo, China;(2) Institute of CIM, Shanghai Jiao Tong University, 200030 Shanghai, China |
| |
| Abstract: | In the environment of customization, disturbances such as rush orders and material shortages often occur in the manufacturing system, so rescheduling is necessary for the manufacturing system. The rescheduling methodology should be able to dispose of the disturbance efficiently so as to keep production going smoothly. This aims researching flow shop rescheduling problem (FSRP) necessitated by rush orders. Disjunctive graph is employed to demonstrate the FSRP. For a flow shop processing n jobs, after the original schedule has been made, and z out of n jobs have been processed in the flow shop, x rush orders come, so the original n jobs together with x rush orders should be rescheduled immediately so that the rush orders would be processed in the shortest time and the original jobs could be processed subject to some optimized criteria. The weighted mean flow time of both original jobs and rush orders is used as objective function. The weight for rush orders is much bigger than that of the original jobs,so the rush orders should be processed early in the new schedule. The ant colony optimization (ACO) algorithm used to solve the rescheduling problem has a weakness in that the search may fall into a local optimum. Mutation operation is employed to enhance the ACO performance. Numerical experiments demonstrated that the proposed algorithm has high computation repeatability and efficiency. |
| |
| Keywords: | Flow shop rescheduling Dynamic scheduling Rush order Ant colony optimization Mutation operation |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
