首页 | 官方网站   微博 | 高级检索  
     

交货期窗口大小给定和待定情况下的单机排序问题
引用本文:赵洪銮,张海燕.交货期窗口大小给定和待定情况下的单机排序问题[J].山东大学学报(理学版),2007,42(8):55-57.
作者姓名:赵洪銮  张海燕
作者单位:1. 山东建筑大学,计算机科学与技术学院,山东,济南,250101
2. 山东大学,数学与系统科学学院,山东,济南,250100;山东交通学院,数理系,山东,济南,250023
摘    要:研究有公共交货期窗口的单机排序问题,其目标是最小化提前和延误的赋权工件数.首先考虑交货期窗口大小给定的情况,进而讨论了当其大小待定且有线性时间惩罚的情形.分别给出最优排序的一些性质,根据这些性质提出了多项式时间的最优算法以最小化所有费用的和.

关 键 词:排序  交货期窗口  提前  延误
文章编号:1671-9352(2007)08-0055-03
修稿时间:2006-03-20

A single machine scheduling problem with given or undetermined due window size
ZHAO Hong-luan,ZHANG Hai-yan.A single machine scheduling problem with given or undetermined due window size[J].Journal of Shandong University,2007,42(8):55-57.
Authors:ZHAO Hong-luan  ZHANG Hai-yan
Affiliation:1. School of Computer Science and Technology, Shandong Jianzhu University, Jinan 250101, Shandong, China; 2. Department of Mathematics and System Science, Shandong University, Jinan 250100, Shandong, China; 3. Department of mathematics and Physics, Shandong Jiaotong University, Jinan 250023, Shandong, China
Abstract:A single machine scheduling problem with a common due window is investigated to minimize the weighted number of early and late jobs. It is considered that the window size is given or to be determined with a linear penalty. Following several properties of an optimal schedule, polynomial algorithms are proposed to minimize the sum of all the penalties for beth cases.
Keywords:scheduling  due window  earliness  tardiness
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《山东大学学报(理学版)》浏览原始摘要信息
点击此处可从《山东大学学报(理学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号