Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6421153 | Applied Mathematics and Computation | 2014 | 7 Pages |
Abstract
In this paper we investigate a single machine scheduling problem with decreasing time-dependent processing times and group technology assumption. By the decreasing time-dependent processing times and group technology assumption, we mean that the group setup times and job processing times are both decreasing linear functions of their starting times. We want to minimize the makespan subject to release dates. We show that the problem can be solved in polynomial time.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Yuan-Yuan Lu, Jian-Jun Wang, Ji-Bo Wang,