摘要
对以作业提前或延期惩罚因素之和最小为目标函数的互替机床调度问题进行了描述 ,提出和阐述了一种四段式启发式算法 ,并通过大量不同规模的问题仿真对该算法进行了评价分析 ,结果表明该算法可行。
This paper considered a scheduling problem in which each of independent jobs is to be processed without interruption on one of identical machines. For each job, a due date, the earliness/tardiness penalty weights and the processing time on the machines were given. The objective is to minimize the weighted sum of earliness and tardiness penalties. In order to solve a sound sub-optimal solution of the scheduling problems efficiently, a heuristic algorithm was proposed on the basis of a 4-phase heuristic and a series of computational experiments were done on randomly generated test problems. The results show that the proposed heuristic algorithm is simple and efficient.
出处
《中国机械工程》
EI
CAS
CSCD
北大核心
2004年第22期2001-2005,共5页
China Mechanical Engineering
基金
国家 8 63高技术研究发展计划资助项目( 2 0 0 3AA414 0 3 3 )
柔性制造系统技术国防科技重点实验室基金资助项目 ( 5 14 5 80 60 10 4JW 0 3 16)
关键词
调度
互替机床
提前/延期惩罚
启发式算法
禁忌搜索
scheduling
heuristic algorithm
tabu search
identical machines
earliness and tardiness penalties
