Pages that link to "Item:Q1397236"
From MaRDI portal
The following pages link to Modelling and solving employee timetabling problems (Q1397236):
Displaying 16 items.
- Near-optimal MIP solutions for preference based self-scheduling (Q284428) (← links)
- A constraint-based approach for the shift design personnel task scheduling problem with equity (Q336540) (← links)
- A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand (Q342022) (← links)
- Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem (Q342548) (← links)
- A comparison of three heuristics on a practical case of sub-daily staff scheduling (Q475194) (← links)
- Alternative MIP formulations for an integrated shift scheduling and task assignment problem (Q496690) (← links)
- Modeling staff scheduling problems. A tutorial (Q596257) (← links)
- Iterative restart technique for solving timetabling problems. (Q1417483) (← links)
- Modeling and solving staff scheduling with partial weighted maxSAT (Q1730743) (← links)
- A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem (Q1749483) (← links)
- Solving the general employee scheduling problem (Q2333146) (← links)
- Distributed personnel scheduling -- negotiation among scheduling agents (Q2468742) (← links)
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem (Q2470097) (← links)
- First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem (Q2664285) (← links)
- Generalizing Global Constraints Based on Network Flows (Q5302729) (← links)
- Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)
