点击次数：
论文类型：会议论文
发表时间：2014-06-22
收录刊物：EI
卷号：644-650
页面范围：2022-2025
摘要：This paper studies a multiple common due date assignment problem on a single machine. The job-dependent due dates 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 multiple common dues, the set of jobs assigned to each due date, the sequence of jobs and resource allocation scheme to minimize a total cost based on earliness and tardiness of jobs, the common dues and resource cost. We propose an O(nlog n) optimal algorithm to solve the problem. © (2014) Trans Tech Publications, Switzerland.