Pages that link to "Item:Q541689"

The following pages link to Personnel scheduling: models and complexity (Q541689):

Displaying 31 items.

• Polynomially solvable personnel rostering problems (Q320874) (← links)
• Sustainable operations (Q323159) (← links)
• A constraint-based approach for the shift design personnel task scheduling problem with equity (Q336540) (← links)
• A constraint programming based column generation approach to nurse rostering problems (Q339698) (← links)
• Pattern-based decompositions for human resource planning in home health care services (Q342406) (← links)
• Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem (Q342548) (← links)
• A goal programming model for staff scheduling at a telecommunications center (Q367238) (← links)
• Network flow models for intraday personnel scheduling problems (Q475176) (← links)
• A hybrid integer and constraint programming approach to solve nurse rostering problems (Q1652269) (← links)
• Staff and machine shift scheduling in a German potash mine (Q1702661) (← links)
• Improved quantum genetic algorithm in application of scheduling engineering personnel (Q1722233) (← links)
• Integer programming model extensions for a multi-stage nurse rostering problem (Q1730747) (← links)
• A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals (Q1753439) (← links)
• Flow-based formulations for operational fixed interval scheduling problems with random delays (Q1789616) (← links)
• Piecewise linear model for multiskilled workforce scheduling problems considering learning effect and project quality (Q1793043) (← links)
• Analytics for labor planning in systems with load-dependent service times (Q2023944) (← links)
• A scenario-based robust optimization with a pessimistic approach for nurse rostering problem (Q2025104) (← links)
• A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing (Q2027048) (← links)
• A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions (Q2029954) (← links)
• Cost of fairness in agent scheduling for contact centers (Q2076355) (← links)
• Multiskilled personnel assignment problem under uncertain demand: a benchmarking analysis (Q2086869) (← links)
• TLMPA: teaching-learning-based marine predators algorithm (Q2131549) (← links)
• Solving technician routing and scheduling problem using improved particle swarm optimization (Q2156960) (← links)
• Counting and enumerating feasible rotating schedules by means of Gröbner bases (Q2228806) (← links)
• Joint employee weekly timetabling and daily rostering: a decision-support tool for a logistics platform (Q2256198) (← links)
• A graph-based formulation for the shift rostering problem (Q2301967) (← links)
• Solving the general employee scheduling problem (Q2333146) (← links)
• A variable neighborhood search algorithm for an integrated physician planning and scheduling problem (Q2676356) (← links)
• An MIP model to schedule the call center workforce and organize the breaks (Q4989258) (← links)
• A classification scheme for integrated staff rostering and scheduling problems (Q5247703) (← links)
• Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach (Q6106764) (← links)