Pages that link to "Item:Q2783948"

The following pages link to Personnel tour scheduling when starting-time restrictions are present (Q2783948):

Displaying 19 items.

• A mixed integer programming approach to multi-skilled workforce scheduling (Q283273) (← links)
• Inexact smoothing method for large scale minimax optimization (Q425468) (← links)
• A stochastic programming model for scheduling call centers with global service level agreements (Q613494) (← links)
• Balancing staffing and switching costs in a service center with flexible servers (Q856284) (← 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)
• Mathematical models and solution approach for cross-training staff scheduling at call centers (Q1652427) (← 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)
• A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
• Workforce planning at USPS mail processing and distribution centers using stochastic optimization (Q2468733) (← links)
• A branch-and-price approach for large-scale employee tour scheduling problems (Q2468738) (← links)
• Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap (Q2468739) (← links)
• Variable employee productivity in workforce scheduling (Q2572245) (← links)
• The personnel task scheduling problem (Q2735088) (← links)
• An integer programming model for the weekly tour scheduling problem (Q2781056) (← links)
• Starting-time decisions in labor tour scheduling: An experimental analysis and case study (Q5935380) (← links)
• A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements (Q6113339) (← links)
• A smoothing three-term conjugate gradient method for solving finite minimax problems (Q6665161) (← links)