The following pages link to The minimum shift design problem (Q2468734):
Displaying 10 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- A Benders decomposition-based matheuristic for the cardinality constrained shift design problem (Q323346) (← 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)
- Minimizing average project team size given multi-skilled workers with heterogeneous skill levels (Q1651635) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- A successful three-phase metaheuristic for the shift minimization personal task scheduling problem (Q2064748) (← links)
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← links)
- Modeling and solving a real-life multi-skill shift design problem (Q2398430) (← links)
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm (Q2514834) (← links)
- Shift Design with Answer Set Programming (Q3449188) (← links)
