Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
复制标题
具有学习效果和资源依赖处理时间的单机到期窗口分配和调度
DOI：
10.1142/s0217595914500365
复制
发表时间：
2014-10-01
影响因子：
1.4
通讯作者：
Wang, Ming-Zheng
中科院分区：
文献类型：
--
作者：
Wang, Ji-Bo;Wang, Ming-Zheng
本文考虑了单机公共交货期窗口指派排序问题，其中工件的加工时间是工件在序列中的位置和资源分配的函数。要确定窗口位置和大小，沿着使某个成本函数最小化的相关作业进度表。该函数由与窗口位置、窗口大小、提前和延迟相关的成本组成。对于两个不同的加工时间函数，我们分别给出了一个多项式时间算法来求解最优的工件序列和资源分配。
We consider a single-machine common due-window assignment scheduling problem, in which the processing time of a job is a function of its position in a sequence and its resource allocation. The window location and size, along with the associated job schedule that minimizes a certain cost function, are to be determined. This function is made up of costs associated with the window location, window size, earliness, and tardiness. For two different processing time functions, we provide a polynomial time algorithm to find the optimal job sequence and resource allocation, respectively.