Relocation scheduling subject to fixed processing sequences
- Publication Type:
- Journal Article
- Citation:
- Journal of Scheduling, 2016, 19 (2), pp. 153 - 163
- Issue Date:
- 2016-04-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| JoSH_Author.pdf | Published Version | 912.61 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2015, Springer Science+Business Media New York. 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 (Formula presented.) time, where (Formula presented.) and (Formula presented.) are the numbers of jobs on the two machines. The simplified case with a common job processing time can be solved in (Formula presented.) 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 (Formula presented.) time. The studied problem for the minimization of number of tardy jobs is solvable in (Formula presented.) time. The solvability of the common-processing-time problems can be generalized to the m-machine cases, where (Formula presented.).
Please use this identifier to cite or link to this item: