首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一个带退化工件的单机准时生产制问题
引用本文:刘静,闵啸.一个带退化工件的单机准时生产制问题[J].浙江大学学报(理学版),2010,37(1):34-37.
作者姓名:刘静  闵啸
作者单位:嘉兴学院,数学与信息工程学院,数学系,浙江,嘉兴,314001
基金项目:嘉兴学院重点科研课题基金 
摘    要:研究带退化工件的单机排序问题,即工件的加工时间是其开始加工时间的线性递增函数,且不同的工件具有不同的退化率.要求为所有工件寻找一共同的最优交货期和最优序,以极小化这些工件的共同交货期、超前罚和迟后罚之和.给出了一O(nlogn)时间的最优算法.

关 键 词:单机排序  共同交货期  退化工件  准时  多项式时间算法

Just-in-time on single machine scheduling problem with deteriorating jobs
LIU Jing,MIN Xiao.Just-in-time on single machine scheduling problem with deteriorating jobs[J].Journal of Zhejiang University(Sciences Edition),2010,37(1):34-37.
Authors:LIU Jing  MIN Xiao
Institution:(Department of Mathematics, College of Mathematics and Information Engineering, Jiaxing University, Jiaxing 314001, Zhejiang Province, China)
Abstract:One single machine scheduling problem with deteriorating jobs is studied, which means the jobs whose processing times are an increasing liner function of their start times, and the different job deterioration are inequality for all jobs. The problem is to determine an optimal common due-date and schedule so as to minimize the sum of due-date, earliness and tardiness penalties. An O(n log n) time algorithm is given to solve this problem.
Keywords:single machine scheduling  common due-date  deteriorating jobs  just-in-time  polynomial algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《浙江大学学报(理学版)》浏览原始摘要信息
点击此处可从《浙江大学学报(理学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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