提前/延期惩罚最小化互替机床调度算法  

A Scheduling Algorithm for Parallel Machines with the Objective of Minimizing Earliness and Tardiness Penalties

作　　者：周炳海[1,2] 王国龙[1] 奚立峰[1] 

机构地区：[1]上海交通大学机械与动力工程学院 [2]上海工程技术大学机械工程学院,上海200336

出　　处：《计算机工程》2004年第18期10-12,189,共4页Computer Engineering

基　　金：国家"863"计划/CIMS主题资助项目(2001AA412250);上海市高校科技发展基金项目(02FK04)

摘　　要：对以提前/延期(E/T)惩罚最小为目标的互替机床调度问题进行了研究。对互替机床E/T调度问题进行了描述,提出了解决调度问题的具体策略。在此基础上,建立了基于启发式的互替机床E/T调度算法。最后通过仿真实验验证了本算法的有效性和实用性。The scheduling problem of identical parallel machines is studied with the objective of minimizing earliness and tardiness penalties. Firstly, the statement and assumption of the scheduling problem are introduced; then the strategies of solving the scheduling problems are presented in details. On the basis of mentioned the above, an algorithm based on heuristic is built for solving the scheduling problems. Finally, the proposed algorithm is verified to be effect and applied by simulation tests.

关 键 词：调度 排序 互替机床 启发式算法 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]