Name
Abstract | ||
|---|---|---|
Abstract Scheduling with general truncated job-dependent learning effect and resource-dependent processing times is studied on a single machine. It is assumed that the job processing time is a function of the amount of resource allocated to the job, the general job-dependent learning effect and the job-dependent control parameter. For each version of the problem that differs in terms of the objective functions and the processing time functions, the optimal resource allocation is provided. Polynomial time algorithms are also developed to find the optimal schedule of several versions of the problem. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10878-015-9984-5 | Journal of Combinatorial Optimization |
Keywords | Field | DocType |
Scheduling,Resource allocation,Single machine,Job-dependent learning effect,Controllable processing times | Mathematical optimization,Learning effect,Scheduling (computing),Computer science,Resource allocation,Time complexity | Journal |
Volume | Issue | ISSN |
33 | 2 | 1573-2886 |
Citations | PageRank | References |
3 | 0.39 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongyu He | 1 | 5 | 1.10 |
| Mengqi Liu | 2 | 15 | 5.32 |
| Jibo Wang | 3 | 745 | 41.50 |