| 工件有工期并且可拒绝单机最小化最大提前时间的排序问题 |
| |
| 引用本文： | 聂玲,程涛. 工件有工期并且可拒绝单机最小化最大提前时间的排序问题[J]. 郑州大学学报(自然科学版), 2012, 0(3): 42-45 |
| |
| 作者姓名： | 聂玲 程涛 |
| |
| 作者单位： | [1]郑州大学数学系,河南郑州450001 [2]河南工业大学理学院,河南郑州450001 |
| |
| 摘 要： | 研究工件有工期并且可拒绝的单机最小化最大提前时间的排序问题.若工件被拒绝,则需支付一定的惩罚费用;若工件被接受,则将该工件安排在机器上加工.目标函数是最小化被接收工件的最大提前完工时间与被拒绝工件的惩罚费用之和.通过对该排序问题的Pareto最优点的分析,得到该问题的多项式算法.
|
| 关 键 词： | 排序 拒绝费用 最大提前时间Emax Pareto最优点 trade-off曲线 |
Minimize the Maximum Earliness for Single-machine Scheduling with Due Dates and Rejection |
| |
| NIE Ling,CHENG Tao. Minimize the Maximum Earliness for Single-machine Scheduling with Due Dates and Rejection[J]. Journal of Zhengzhou University (Natural Science), 2012, 0(3): 42-45 |
| |
| Authors: | NIE Ling CHENG Tao |
| |
| Affiliation: | 1.Department of Mathematics,Zhengzhou University,Zhengzhou 450001,China; 2.College of Sciences,Henan University of Technology,Zhengzhou 450001,China) |
| |
| Abstract: | Single-machine scheduling problems under job rejection constraint were considered.A job was either rejected,in which case a rejection penalty had to be paid,or accepted and processed on single machine.The object was to minimize the sum of the maximum earliness of accepted jobs and the total rejection penalty of rejected jobs.A polynomial-time solution was found for the problem through analyzing the Pareto optimal points. |
| |
| Keywords: | scheduling rejected penalty maximum earliness Pareto optimal points trade-off curve |
| 本文献已被 维普 等数据库收录！ |
