| 具有最大作业延迟的生产调度优化算法及仿真 |
| |
| 引用本文： | 王秀利,吴惕华,刘磊. 具有最大作业延迟的生产调度优化算法及仿真[J]. 计算机仿真, 2003, 20(6): 40-42 |
| |
| 作者姓名： | 王秀利 吴惕华 刘磊 |
| |
| 作者单位： | 1. 上海交通大学自动化研究所,上海,200030
2. 河北省科学院,河北,石家庄,050081 |
| |
| 基金项目： | 河北省自然科学基金 ( 60 2 62 4) |
| |
| 摘 要： | 成组作业优化调度问题中的作业根据其加工特点要求可分成若干作业类。同一类的作业连续加工，其后的作业不需要机器设置花费，而不同类的作业连续加工，其后的作业需要机器设置花费。当优化目标是最大作业延迟时，单机成组作业优化调度是HP—hard。本文在利用优化性质的基础上，提出了一种适于大规模优化调度问题的多项式时间算法。仿真实验表明该算法具有良好的性能。
|
| 关 键 词： | 生产调度优化算法 最大作业延迟 NP问题 仿真 多项式时间算法 |
| 文章编号： | 1006-9348(2003)06-0040-03 |
| 修稿时间： | 2002-10-22 |
An Approach for Single Machine Grouping Job Scheduling with Maximum Lateness |
| |
| WANG Xiu-li,WU Ti-hua,LIU Lei. An Approach for Single Machine Grouping Job Scheduling with Maximum Lateness[J]. Computer Simulation, 2003, 20(6): 40-42 |
| |
| Authors: | WANG Xiu-li WU Ti-hua LIU Lei |
| |
| Affiliation: | WANG Xiu-li1,WU Ti-hua1,LIU Lei2 |
| |
| Abstract: | In the grouping jobs scheduling optimal problem, jobs are divided into several job classes according to their processing characters. If a job is first processed or does not belong to the same job class as its just ahead job, a setup time is required before it processed. Otherwise, a setup time is not required. For the optimal objective of maximum lateness, the grouping jobs scheduling optimal problem is NP-hard. Basing on the optimal properties, this paper proposes a polynomial time algorithm which is suitable to solve the large scale scheduling problem. Simulation shows this algorithm has very good performance. |
| |
| Keywords: | Scheduling Job class Polynomial time algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
