点击次数：

论文类型：会议论文

发表时间：2014-06-22

收录刊物：EI、Scopus

文献类型：A

卷号：644-650

页面范围：2026-2029

摘要：This paper studies a multiple common due-window assignment problem on a single machine. The job-dependent due-windows are obtained based on common flow allowance criteria. We assume that the processing time of a job is controllable by the resource amount assigned to it. The objective is to find the optimal size and location of the multiple common due-windows, the set of jobs assigned to each due window, the sequence of jobs and resource allocation scheme to minimize a cost function based on the window size and location, earliness and tardiness of jobs and resource cost. We propose an O(n3) optimal algorithm to solve the problem. ? (2014) Trans Tech Publications, Switzerland.