冯恩民
Professor
Gender:Male
Alma Mater:大连工学院
School/Department:数学科学学院
E-Mail:emfeng@dlut.edu.cn
Hits:
Indexed by:会议论文
Date of Publication:2014-06-22
Included Journals:EI
Volume:644-650
Page Number:2022-2025
Abstract: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.
