Pages that link to "Item:Q972651"

The following pages link to A large neighbourhood search approach to the multi-activity shift scheduling problem (Q972651):

Displaying 18 items.

• Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce (Q323020) (← links)
• A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem (Q398914) (← links)
• The weighted grammar constraint (Q545550) (← links)
• An implicit model for multi-activity shift scheduling problems (Q1617280) (← links)
• Combining Benders decomposition and column generation for multi-activity tour scheduling (Q1652589) (← links)
• A two-stage stochastic programming approach for multi-activity tour scheduling (Q1683088) (← links)
• Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model (Q1730633) (← links)
• Orbital shrinking: theory and applications (Q1786877) (← links)
• A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205) (← links)
• Learning to reduce state-expanded networks for multi-activity shift scheduling (Q2117239) (← links)
• A decomposition-based heuristic for large employee scheduling problems with inter-department transfers (Q2175366) (← links)
• Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic (Q2341394) (← links)
• Modeling and solving a real-life multi-skill shift design problem (Q2398430) (← links)
• Formal languages for integer programming modeling of shift scheduling problems (Q2430360) (← links)
• Branch-and-Price for Personalized Multiactivity Tour Scheduling (Q3186663) (← links)
• An exact bidirectional pulse algorithm for the constrained shortest path (Q6092654) (← links)
• A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment (Q6547137) (← links)
• Block-based state-expanded network models for multi-activity shift scheduling (Q6620465) (← links)