Group scheduling with group-dependent multiple due windows assignment
Group scheduling with group-dependent multiple due windows assignment
复制标题
具有组相关的多个到期窗口分配的组调度
DOI：
10.1080/00207543.2015.1058538
复制
发表时间：
2016-01-01
影响因子：
9.2
通讯作者：
Tan, Yuanyuan
中科院分区：
文献类型：
--
作者：
Ji, Min;Zhang, Xin;Tan, Yuanyuan
研究了具有组相关多到期窗口分配的单机群调度问题。在成组技术环境中，根据作业的加工相似度，将作业预先划分成组，同一组的所有作业连续加工，以提高生产效率。在处理每组的第一个作业之前，有一个顺序无关的机器设置时间。每个组有与组相关的多个到期窗口。目标是找到最优作业序列，分配给每个到期窗口序列的作业集，最优组序列和最优到期窗口分配，以最小化总成本，包括提前和延迟处罚以及到期窗口开始时间和到期窗口大小成本。对于提前给出每组每个到期窗口分配的作业数量的情况，我们证明问题是及时可解的，其中n为作业总数。对于每组分配给每个到期窗口的作业数未知的情况，给出了求解该问题的时间算法，其中，hi为第i组的到期窗口数。
We consider single-machine group scheduling with group-dependent multiple due windows assignment. In the group technology environment, the jobs are divided into groups in advance according to their processing similarities, and all the jobs of the same group are processed consecutively in order to improve production efficiency. A sequence-independent machine set-up time precedes the processing of the first job of each group. Each group has group-dependent multiple due windows. The objective is to find the optimal job sequence, the set of jobs assigned to each due window sequence, the optimal group sequence, and the optimal due window assignment to minimise a total cost that comprises the earliness and tardiness penalties and the due window starting time and due window size costs. For the case where the number of jobs assigned to each due window in each group is given in advance, we show that the problem is solvable in time, where n is the total number of jobs. For the case where the number of jobs assigned to each due window in each group is unknown, we give an time algorithm to solve the problem, where and hi is the number of due window of the ith group.