Name
Abstract | ||
|---|---|---|
We discuss the student scheduling problem as it generally applies to high schools in North America. We show that the problem is NP-hard. We discuss various multi-commodity flow formulations, with fractional capacities and integral gains, and we show how a number of practical objectives can be accommodated by the models. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/978-3-540-45157-0_20 | LECTURE NOTES IN COMPUTER SCIENCE |
Keywords | Field | DocType |
scheduling,educational timetabling,mathematical programming,multi-commodity o w.,operational research,complexity issues,scheduling problem,operations research | Mathematical optimization,Job shop scheduling,Computer science,Flow (psychology),Nurse scheduling problem,Multi-commodity flow problem,Dynamic priority scheduling | Conference |
Volume | ISSN | Citations |
2740 | 0302-9743 | 6 |
PageRank | References | Authors |
0.56 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eddie Cheng | 1 | 511 | 37.86 |
| Serge Kruk | 2 | 10 | 1.64 |
| Marc J. Lipman | 3 | 230 | 17.64 |