两台并行机器上进行多属性准备时间的工序设置问题  

Scheduling with Multi-Attribute Preparation Times on Two Parallel Machines

作　　者：熊辉 梁培锋 王晓佳 朱彬 

机构地区：[1]广东广业开元科技有限公司,广东广州 [2]广州临观教育信息有限公司,广东广州

出　　处：《应用数学进展》2018年第10期1325-1333,共9页Advances in Applied Mathematics

基　　金：国家自然科学基金(No.11271069)。

摘　　要：本文研究聚氯乙烯皮革(PVCL)工厂的多重属性准备时间的工序设置问题。针对于两台同样的并行机器,按顺序生产具有不同层次、不同属性、不同工种的PVCL制品,目标函数是设置一个加工排序,使得最大完工时间极小化。首先提出一个建构式的启发式演算法,与工厂现行排序法做比较,以评估此算法的绩效;继续提出变邻域搜寻算法,以进一步改善启发式算法所求得的解,并与混合整数规划模型做比较。实验结果证明,本文的启发式演算法显著性地优于现行PVCL工厂所使用的排序方法,而VNS算法的运行结果也证实能有效改善启发式演算法所求得的解。The scheduling problem with multi-attribute preparation times studied here is from the polyvinyl chloride leather (PVCL) plant. On two identical parallel machines, the products are processed in sequence of different levels, attributes, and jobs. The objective is to determine a schedule for two identical parallel machines to minimize the makespan. A constructive heuristic is firstly proposed and evaluated by comparing with the current scheduling method used by the case plant. To further improve the solution, a variable neighborhood search (VNS) meta-heuristic is presented and compared with a mixed integer programming model. The computational results show that the heuristic outperforms the current scheduling method with a significant improvement, and the VNS can further improve the solution.

关 键 词：并行机器 工序设置 多重属性准备时间 启发式演算 变邻域搜索 

分 类 号：G6[文化科学—教育学]