Name
Title | ||
|---|---|---|
Bicriterion Scheduling With Truncated Learning Effects And Convex Controllable Processing Times |
Abstract | ||
|---|---|---|
This paper investigates single-machine scheduling in which the processing time of a job is a function of its position in a sequence, a truncation parameter, and its resource allocation. For a convex resource consumption function, we provide a bicriteria analysis where the first is to minimize total weighted flow (completion) time, and the second is to minimize total resource consumption cost. If the weights are positional-dependent weights, we prove that three versions of considering the two criteria can be solved in polynomial time, respectively. If the weights are job-dependent weights, the computational complexity of the three versions of the two criteria remains an open question. To solve the problems with job-dependent weights, we present a heuristic (an upper bound) and a branch-and-bound algorithm (an exact solution). |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1111/itor.12888 | INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH |
Keywords | DocType | Volume |
scheduling, branch‐, and‐, bound, combinatorial optimization, heuristics, controllable processing time, truncated learning effect | Journal | 28 |
Issue | ISSN | Citations |
3 | 0969-6016 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jibo Wang | 1 | 745 | 41.50 |
| Dan‐Yang Lv | 2 | 0 | 0.34 |
| Jian Xu | 3 | 0 | 1.35 |
| P Ji | 4 | 187 | 26.88 |
| Fuqiang Li | 5 | 0 | 0.34 |