Pages that link to "Item:Q3157711"
From MaRDI portal
The following pages link to A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows (Q3157711):
Displayed 8 items.
- A Benders decomposition-based matheuristic for the cardinality constrained shift design problem (Q323346) (← links)
- Implicit shift scheduling with multiple breaks and work stretch duration restrictions (Q969752) (← links)
- A large neighbourhood search approach to the multi-activity shift scheduling problem (Q972651) (← links)
- Combining integer programming and the randomization method to schedule employees (Q1038393) (← links)
- A comparative evaluation of modeling approaches to the labor shift scheduling problem (Q1580984) (← links)
- Formal languages for integer programming modeling of shift scheduling problems (Q2430360) (← links)
- Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap (Q2468739) (← links)
- Solution approaches to large shift scheduling problems (Q3539809) (← links)