The following pages link to (Q4487087):
Displaying 35 items.
- An exact algorithm for an integrated project staffing problem with a homogeneous workforce (Q282236) (← links)
- Near-optimal MIP solutions for preference based self-scheduling (Q284428) (← links)
- Retail store scheduling for profit (Q297364) (← links)
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
- A Benders decomposition-based matheuristic for the cardinality constrained shift design problem (Q323346) (← links)
- Optimal shift partitioning of pharmacies (Q337411) (← links)
- A branch-and-bound algorithm for shift scheduling with stochastic nonstationary demand (Q342137) (← links)
- Flexible weekly tour scheduling for postal service workers using a branch and price (Q398850) (← links)
- A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem (Q398914) (← links)
- Branch-and-price approach for the multi-skill project scheduling problem (Q479223) (← links)
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem (Q969750) (← links)
- Implicit shift scheduling with multiple breaks and work stretch duration restrictions (Q969752) (← links)
- A large neighbourhood search approach to the multi-activity shift scheduling problem (Q972651) (← links)
- Long-term staffing based on qualification profiles (Q1006561) (← links)
- Models and algorithms for a staff scheduling problem (Q1424308) (← links)
- A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints (Q1628053) (← links)
- Combining Benders decomposition and column generation for multi-activity tour scheduling (Q1652589) (← links)
- A stochastic optimization approach to shift scheduling with breaks adjustments (Q1738827) (← links)
- Workforce planning in a lotsizing mail processing problem (Q1781576) (← links)
- Formal languages for integer programming modeling of shift scheduling problems (Q2430360) (← links)
- Scheduling trainees at a hospital department using a branch-and-price approach (Q2432850) (← links)
- Analysis of three mathematical models of the staff rostering problem (Q2434266) (← links)
- On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem (Q2468737) (← links)
- A branch-and-price approach for large-scale employee tour scheduling problems (Q2468738) (← links)
- A branch-and-price approach for integrating nurse and surgery scheduling (Q2482743) (← links)
- An exact branch-and-price approach for the medical student scheduling problem (Q2668624) (← links)
- Grammar-based integer programming models for multi-activity shift scheduling (Q2883642) (← links)
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm (Q3055658) (← links)
- A Polyhedral Approach for the Staff Rostering Problem (Q3114885) (← links)
- A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows (Q3157711) (← links)
- Branch-and-Price for Personalized Multiactivity Tour Scheduling (Q3186663) (← links)
- Solution approaches to large shift scheduling problems (Q3539809) (← links)
- Optimal Shift Scheduling with Multiple Break Windows (Q4363620) (← links)
