標題: Relocation scheduling subject to fixed processing sequences
作者: Lin, Bertrand M. T.
Hwang, F. J.
Kononov, Alexander V.
資訊管理與財務金融系
註:原資管所+財金所

Department of Information Management and Finance
關鍵字: Relocation problem;Resource-constrained scheduling;Parallel dedicated machines;Fixed sequence;Dynamic programming;NP-hardness
公開日期: Apr-2016
摘要: This study addresses a relocation scheduling problem that corresponds to resource-constrained scheduling on two parallel dedicated machines where the processing sequences of jobs assigned to the machines are given and fixed. Subject to the resource constraints, the problem is to determine the starting times of all jobs for each of the six considered regular performance measures, namely, the makespan, total weighted completion time, maximum lateness, total weighted tardiness, weighted number of tardy jobs, and number of tardy jobs. By virtue of the proposed dynamic programming framework, the studied problem for the minimization of makespan, total weighted completion time, or maximum lateness can be solved in time, where and are the numbers of jobs on the two machines. The simplified case with a common job processing time can be solved in time. For the objective function of total weighted tardiness or weighted number of tardy jobs, this problem is proved to be NP-hard in the ordinary sense, and the case with a common job processing length is solvable in time. The studied problem for the minimization of number of tardy jobs is solvable in time. The solvability of the common-processing-time problems can be generalized to the m-machine cases, where .
URI: http://dx.doi.org/10.1007/s10951-015-0455-8
http://hdl.handle.net/11536/133444
ISSN: 1094-6136
DOI: 10.1007/s10951-015-0455-8
期刊: JOURNAL OF SCHEDULING
Volume: 19
Issue: 2
起始頁: 153
結束頁: 163
Appears in Collections:Articles