Pages that link to "Item:Q1906950"
From MaRDI portal
The following pages link to On the complexity of manpower shift scheduling (Q1906950):
Displayed 23 items.
- Near-optimal MIP solutions for preference based self-scheduling (Q284428) (← links)
- Polynomially solvable personnel rostering problems (Q320874) (← links)
- 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)
- A hybrid integer and constraint programming approach to solve nurse rostering problems (Q1652269) (← links)
- Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model (Q1730633) (← links)
- Modeling and solving staff scheduling with partial weighted maxSAT (Q1730743) (← links)
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
- Instance space analysis for a personnel scheduling problem (Q2043438) (← links)
- The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers (Q2173054) (← links)
- Counting and enumerating feasible rotating schedules by means of Gröbner bases (Q2228806) (← links)
- A graph-based formulation for the shift rostering problem (Q2301967) (← 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)
- An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment (Q2669741) (← links)
- Team-building with answer set programming in the Gioia-Tauro seaport (Q2909524) (← links)
- A General Branch-and-Cut Framework for Rotating Workforce Scheduling (Q5087722) (← links)
- A classification scheme for integrated staff rostering and scheduling problems (Q5247703) (← links)
- A note on a single-shift days-off scheduling problem with sequence-dependent labor costs (Q6173709) (← links)