带有公共交货期窗口和加工时间可控的单机排序问题  被引量:8

Single Machine Scheduling with Common Due-Window Assignment and Controllable Processing Times

在线阅读下载全文

作  者:郭玲[1] 赵传立[1] 

机构地区:[1]沈阳师范大学数学与系统科学学院,沈阳110034

出  处:《重庆师范大学学报(自然科学版)》2012年第6期9-14,共6页Journal of Chongqing Normal University:Natural Science

基  金:国家自然科学基金(No.10471096)

摘  要:讨论了带有公共交货期窗口和工件的加工时间可控的单机排序问题。假设工件的加工时间是所分配资源的线性非增函数,且分配资源会产生费用。交货期窗口的开始时间是固定且不受限制的,交货期窗口的结束时间是不确定的决策变量(即交货期窗口的大小不确定)。如果工件在窗口中完工则不产生费用,否则工件提前或延误,则会产生相应的提前或延误的费用。目标函数是极小化总完工时间,提前时间,延误时间,交货期窗口的结束时间(即窗口的开始时间与窗口大小的和)和资源分配的总费用。给出了最优解的一些性质,并且证明了这个问题是多项式时间可解的。We study the scheduling problem on a single machine with common due-window assignment and controllable process- ing times. It is assumed that the processing times of jobs are given as a linear resource allocation function with costs. The due- window starting time is a given parameter and non-restrictive, and the due-window finishing time is a decision variable (i. e. the size of due-window is to be determined). There is no cost where the job is completed during the due-window, but there is cost where the job is completed prior or after the due-window. The objective is to minimize total costs which include total com- pletion time, earliness, tardiness, the due-window finishing time, and resource allocation costs. We have provided some prop- erties of the optimal solution, and shown that the problem is solvable in polynomial time.

关 键 词:排序 单机 窗口 加工时间可控 资源分配 

分 类 号:O221.7[理学—运筹学与控制论]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象