Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10523941 | Operations Research Letters | 2014 | 7 Pages |
Abstract
We consider a single machine scheduling problem for a fixed penalty function f. For this problem every job j has a priority wj, and a processing time pj and the goal is to find an order on the given jobs that minimizes âwjf(Cj), where Cj is the completion time of job j. This paper studies the complexity of this problem for various classes of penalty functions.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ãscar C. Vásquez,