Working set generation methods for labor tour scheduling

DOI10.1016/0377-2217(94)90230-5zbMath0925.90218OpenAlexW2011916813MaRDI QIDQ1333557

Michael J. Brusco, Stephen E. Bechtold

Publication date: 8 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90230-5

Mathematics Subject Classification ID

Related Items (8)

A microcomputer-based heuristic for tour scheduling of a mixed workforce ⋮ Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations ⋮ A branch-and-price approach for large-scale employee tour scheduling problems ⋮ Starting-time decisions in labor tour scheduling: An experimental analysis and case study ⋮ An integer programming model for the weekly tour scheduling problem ⋮ A distributed genetic algorithm for deterministic and stochastic labor scheduling problems ⋮ A sequential integer programming method for discontinuous labor tour scheduling ⋮ Scheduling staff using mixed integer programming

Cites Work

• Unnamed Item
• Sufficient Working Subsets for the Tour Scheduling Problem
• A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
• Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements
• Scheduling of Work Forces Required in Continuous Operations Under Alternative Labor Policies
• The Operator-Scheduling Problem: A Network-Flow Approach

This page was built for publication: Working set generation methods for labor tour scheduling