Pages that link to "Item:Q284428"
From MaRDI portal
The following pages link to Near-optimal MIP solutions for preference based self-scheduling (Q284428):
Displaying 4 items.
- A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering (Q284416) (← links)
- Bridging the gap between self schedules and feasible schedules in staff scheduling (Q475167) (← links)
- Scheduling staff using mixed integer programming (Q1278723) (← links)
- The stable tournament problem: matching sports schedules with preferences (Q1728308) (← links)