Name
Abstract | ||
|---|---|---|
We consider a family of well-known scheduling problems that reduce to the problem of finding a minimum weighted clique in a complete weighted graph with negative weights and self-loops allowed. We present a uniform algorithmic approach to finding optimal as well as suboptimal solutions for these problems. Also, we report results of computational tests for suboptimal algorithms developed in the paper. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0166-218X(96)00040-6 | Discrete Applied Mathematics |
Keywords | Field | DocType |
minimum weighted clique,tabu search,spectral algorithms,minclique scheduling problem,single/multiple machine scheduling,dynamic programming,scheduling problem | Lottery scheduling,Combinatorics,Mathematical optimization,Fair-share scheduling,Clique,Scheduling (computing),Algorithm,Nurse scheduling problem,Rate-monotonic scheduling,Dynamic priority scheduling,Round-robin scheduling,Mathematics | Journal |
Volume | Issue | ISSN |
72 | 1-2 | Discrete Applied Mathematics |
Citations | PageRank | References |
15 | 1.67 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernd Jurisch | 1 | 297 | 40.62 |
| Wieslaw Kubiak | 2 | 540 | 62.61 |
| Joanna Józefowska | 3 | 324 | 25.14 |