Name
Abstract | ||
|---|---|---|
We consider two single machine scheduling problems with resource dependent release times that can be controlled by a non-increasing convex resource consumption function. In the first problem, the objective is to minimize the total resource consumption with a constraint on the sum of job completion times. We show that a recognition version of the problem is NP-complete. In the second problem, the objective is to minimize the weighted total resource consumption and sum of job completion times with an initial release time greater than the total processing times. We provide some optimality conditions and show that the problem is polynomially solvable. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.cor.2005.06.021 | Computers & OR |
Keywords | DocType | Volume |
non-increasing convex resource consumption,polynomially solvable,resource dependent release time,initial release time,weighted total resource consumption,single machine scheduling problem,total processing time,optimality condition,total resource consumption,job completion time | Journal | 34 |
Issue | ISSN | Citations |
7 | Computers and Operations Research | 3 |
PageRank | References | Authors |
0.46 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Byung-Cheon Choi | 1 | 161 | 17.84 |
| Suk-Hun Yoon | 2 | 69 | 5.38 |
| Sung-Jin Chung | 3 | 72 | 8.21 |