Pages that link to "Item:Q4363620"

The following pages link to Optimal Shift Scheduling with Multiple Break Windows (Q4363620):

Displaying 36 items.

• A mixed integer programming approach to multi-skilled workforce scheduling (Q283273) (← links)
• Retail store scheduling for profit (Q297364) (← 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)
• A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts (Q398875) (← links)
• A stochastic programming model for scheduling call centers with global service level agreements (Q613494) (← links)
• Scheduling workforce relief breaks in advance versus in real-time (Q872250) (← links)
• The task assignment problem for unrestricted movement between workstation groups (Q880551) (← 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)
• Combining integer programming and the randomization method to schedule employees (Q1038393) (← links)
• A sequential integer programming method for discontinuous labor tour scheduling (Q1278415) (← links)
• Local search for shift design. (Q1417484) (← links)
• A comparative evaluation of modeling approaches to the labor shift scheduling problem (Q1580984) (← 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)
• A stochastic optimization approach to shift scheduling with breaks adjustments (Q1738827) (← links)
• A distributed genetic algorithm for deterministic and stochastic labor scheduling problems (Q1806613) (← links)
• Staff scheduling at the United States postal Service (Q1870829) (← links)
• The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers (Q2173054) (← 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)
• Workforce planning at USPS mail processing and distribution centers using stochastic optimization (Q2468733) (← links)
• Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap (Q2468739) (← links)
• Generating labor requirements and rosters for mail handlers using simulation and optimization (Q2489309) (← links)
• An integer programming model for the weekly tour scheduling problem (Q2781056) (← links)
• Grammar-based integer programming models for multi-activity shift scheduling (Q2883642) (← 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)
• Maximization of Labor Productivity Through Optimal Rest-Break Schedules (Q3339650) (← links)
• Solution approaches to large shift scheduling problems (Q3539809) (← links)
• (Q4487087) (← links)
• Contingent manpower planning in a high clock speed industry (Q5438661) (← links)
• The equivalence of general set-covering and implicit integer programming formulations for shift scheduling (Q5688019) (← links)
• A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment (Q6547137) (← links)