Pages that link to "Item:Q1906950"
From MaRDI portal
The following pages link to On the complexity of manpower shift scheduling (Q1906950):
Displayed 9 items.
- Personnel scheduling: models and complexity (Q541689) (← links)
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
- A flexible MILP model for multiple-shift workforce planning under annualized hours (Q1044115) (← links)
- Efficient generation of rotating workforce schedules (Q1348256) (← links)
- Local search for shift design. (Q1417484) (← links)
- Short-term manpower planning for MRT carriage maintenance under mixed deterministic and stochastic demands (Q2430593) (← links)
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria (Q2433375) (← links)
- The minimum shift design problem (Q2468734) (← links)
- Team-building with answer set programming in the Gioia-Tauro seaport (Q2909524) (← links)