Optimal due date assignment and resource allocation in a group technology scheduling environment
Optimal due date assignment and resource allocation in a group technology scheduling environment
复制标题
DOI：
10.1016/j.cor.2010.03.012
复制
发表时间：
2010-12
期刊：
影响因子：
--
通讯作者：
D. Shabtay;Yisrael Itskovich;Liron Yedidsion;Daniel Oron
中科院分区：
文献类型：
--
作者：
D. Shabtay;Yisrael Itskovich;Liron Yedidsion;Daniel Oron
研究了在成组技术环境下，调度程序确定不同作业的交货期的单机调度问题。在成组技术（GT）环境中，将作业划分为组（族），并要求对同一族的作业进行连续处理。将工作划分为家庭是为了通过利用不同产品和活动在生产中的相似性来实现大批量生产的效率。由于类似作业的客户可能希望同一组中的所有作业都分配相同的截止日期，因此我们建议采用原始截止日期分配方法，将一个家庭中的所有作业限制为相同的截止日期，而每个家庭可以不受任何限制地分配截止日期。所提出的方法提供了文献中出现的两种早期方法的扩展，其中一种方法包括单个家庭，另一种方法中家庭的数量与工作的数量相同。我们的目标是找到每个组的作业时间表和截止日期，使目标函数最小化，包括提前、迟到和截止日期分配处罚。我们还扩展了分析，以解决作业处理时间依赖于资源的情况。对于这种情况，我们包括了总加权资源消耗和目标函数的最大完工时间惩罚。
We study a single machine scheduling problem in which the scheduler determines due dates for different jobs in a group technology environment. In group technology (GT) environment, a partition of the jobs into groups (families) is given and jobs of the same family are required to be processed consecutively. The partition of the jobs into families is done in order to achieve efficiency of high-volume production by exploiting similarities of different products and activities in their production. Since customers of similar jobs may expect that all jobs within the same group will be assigned with the same due date, we suggest an original due date assignment method in which all jobs within a family are restricted to be assigned the same due date, while each family can be assigned a due date without any restriction. The proposed method provides an extension of two earlier methods that appear in the literature, one which includes a single family and the other in which the number of families is identical to the number of jobs. Our objective is to find the job schedule and the due date for each group that minimizes an objective function which includes earliness, tardiness and due date assignment penalties. We also extend the analysis to address the case in which the job processing times are resource dependent. For this case we include the total weighted resource consumption and the makespan penalties to the objective function.