Name
Abstract | ||
|---|---|---|
We introduce a nonpreemptive single-machine scheduling model with time-dependent multiple criteria. We formulate the problem as a knapsack problem and propose a dynamic programming (DP)-based algorithm to finding all efficient schedules. An illustrative example is enclosed. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0377-2217(00)00286-1 | European Journal of Operational Research |
Keywords | Field | DocType |
Scheduling,Single machine,Time-dependent multiple criteria | Mathematical optimization,Single-machine scheduling,Fair-share scheduling,Computer science,Nurse scheduling problem,Continuous knapsack problem,Rate-monotonic scheduling,Cutting stock problem,Knapsack problem,Dynamic priority scheduling | Journal |
Volume | Issue | ISSN |
135 | 1 | 0377-2217 |
Citations | PageRank | References |
4 | 0.62 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kathrin Klamroth | 1 | 579 | 41.93 |
| Margaret M. Wiecek | 2 | 213 | 22.90 |