On scheduling with non-increasing time slot cost to minimize total weighted completion time
Author(s)
Author(s)
Qi, X.
Li, M.
Date Issued
2016
Publisher
Springer
Journal
Journal of Scheduling
Volume
19
Issue
6
Start page
759
End page
767
Abstract
This paper addresses a recent open scheduling problem which aims to minimize the summation of total weighted completion time and the total machine time slot cost. Focusing on the case of non-increasing time slot cost with non-preemptive jobs, we show that the problem can be solved in polynomial-time when the time slot cost decreases with certain patterns, including linearly decreasing, decreasing concave, and decreasing convex cases. Different methodologies are used for three cases. For the linearly decreasing case, we can classify all the jobs into three categories and schedule the job sets one by one. For the decreasing concave case, we calculate each job's worst starting time and try to make them far away from their worst starting times. For the decreasing concave case, we calculate each job's best starting time and let them start close to their best starting times. Finally, we show that the problem is NP-hard in the strong sense when the time slot cost decreases in an arbitrary way.
SFU Affiliated Publication
Yes
Availability at SFU Library
No database links found.