Relocation scheduling subject to fixed processing sequences

• Published in: Journal of scheduling Vol. 19; no. 2; pp. 153 - 163
• Main Authors: Lin, Bertrand M. T., Hwang, F. J., Kononov, Alexander V.
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.04.2016; Springer Nature B.V
• Subjects: Algorithms; Artificial Intelligence; Buildings; Business and Management; Calculus of Variations and Optimal Control; Optimization; Completion time; Decision making; Dynamic programming; Information management; Job shops; Lateness; Minimization; Operations Research/Decision Theory; Optimization; Production scheduling; Relocation; Resource scheduling; Schedules; Scheduling; Studies; Supply Chain Management; Systems development; Temporary housing; Tenants; Texts; NP-hardness; Relocation problem; Parallel dedicated machines; Dynamic programming; Fixed sequence; Resource-constrained scheduling
• ISSN: 1094-6136; 1099-1425
• DOI: 10.1007/s10951-015-0455-8

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 O ( n 1 n 2 ( n 1 + n 2 ) ) time, where n 1 and n 2 are the numbers of jobs on the two machines. The simplified case with a common job processing time can be solved in O ( n 1 n 2 ) 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 O ( n 1 n 2 min { n 1 , n 2 } ) time. The studied problem for the minimization of number of tardy jobs is solvable in O ( n 1 2 n 2 2 ( n 1 + n 2 ) 2 ) time. The solvability of the common-processing-time problems can be generalized to the m -machine cases, where m ≥ 3 .