The equivalence of general set-covering and implicit integer programming formulations for shift scheduling
✍ Scribed by Stephen E. Bechtold; Larry W. Jacobs
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 808 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
✦ Synopsis
In a recent article we demonstrated that implicit optimal modeling for shift scheduling (P2) has inherent size and execution time advantages over the general set-covering formulation for shift scheduling (PI ) [ 1 I, 131. We postulated that the absence of extraordinary overlap (EO) was a requirement for the equivalence of P1 and P2. We have defined EO as the condition in which the earliest and latest starts for a break in one shift are earlier and later than the earliest and latest starts for a break in any other shift(s). In this article, we prove that our earlier postulate was accurate. Additionally, we discuss research extensions and note other scheduling problems for which implicit modeling may be appropriate.