Name
Abstract | ||
|---|---|---|
This paper introduces a new integrated model for the combined days-off and shift scheduling problem (the tour scheduling problem). This model generalizes the forward and backward constraints, previously introduced by Bechtold and Jacobs for the shift scheduling problem, to the tour scheduling problem. This results in a general and compact formulation that can handle several types of scheduling flexibility. We also provide a new proof of the correctness of forward and backward constraints based on Benders decomposition. The latter approach is interesting in itself because it can be used to solve the problem when extraordinary overlap of break windows or start-time bands is present. A discussion of model size for a set of hypothetical test problems is presented to show the merits of the new formulation. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1023/B:ANOR.0000019101.29692.2c | Annals OR |
Keywords | Field | DocType |
tour scheduling,shifts,breaks,Benders decomposition,implicit model | Mathematical optimization,Multiprocessor scheduling,Job shop scheduling,Computer science,Scheduling (computing),Correctness,Nurse scheduling problem,Dynamic priority scheduling,Benders' decomposition | Journal |
Volume | Issue | ISSN |
128 | 1-4 | 1572-9338 |
Citations | PageRank | References |
23 | 1.31 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Monia Rekik | 1 | 73 | 4.60 |
| Jean-François Cordeau | 2 | 2604 | 127.77 |
| François Soumis | 3 | 821 | 97.64 |