Name
Title | ||
|---|---|---|
Single-machine scheduling with simultaneous considerations of resource allocation and deteriorating jobs. |
Abstract | ||
|---|---|---|
This paper considers a single-machine scheduling problem with deteriorating jobs and convex resource allocation. We assume that the actual processing time of a job is a function of its convex resource allocation and its starting time. For the multi-objective single-machine scheduling problem, we show that the problem is polynomially solvable in
<tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$O\ (n \ \log \ n)$</tex>
time, where n is the total number of jobs. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1093/comjnl/bxy030 | Comput. J. |
Keywords | Field | DocType |
scheduling,deteriorating job,single-machine,controllable processing time,resource allocation | Single-machine scheduling,Computer science,Resource allocation,Distributed computing | Journal |
Volume | Issue | ISSN |
62 | 1 | 0010-4620 |
Citations | PageRank | References |
0 | 0.34 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weiwei Liu | 1 | 0 | 0.34 |
| Chong Jiang | 2 | 2 | 2.05 |
| Jibo Wang | 3 | 745 | 41.50 |
| Yuan-Yuan Lu | 4 | 3 | 1.41 |