Name
Abstract | ||
|---|---|---|
Some results in a recent paper [J.-B. Wang Single-machine scheduling with general learning functions, Computers and Mathematics with Applications 56 (2008) 1941-1947] are incorrect because job processing times are variable due to general learning functions. In this note, we show by a counter-example that the results are incorrect. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.camwa.2011.03.068 | Computers & Mathematics with Applications |
Keywords | Field | DocType |
general learning function,recent paper,wang single-machine scheduling,job processing time | Mathematical optimization,Single-machine scheduling,Fair-share scheduling,Scheduling (computing),Computer science,Two-level scheduling,Theoretical computer science,Rate-monotonic scheduling | Journal |
Volume | Issue | ISSN |
61 | 9 | Computers and Mathematics with Applications |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||