A sequential integer programming method for discontinuous labor tour scheduling
DOI10.1016/S0377-2217(97)81461-0zbMath0926.90041OpenAlexW1996918889MaRDI QIDQ1278415
Tony R. Johns, Michael J. Brusco
Publication date: 29 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)81461-0
heuristicsinteger programmingschedulingservicediscontinuous labor tour schedulingsequential mixed-integer programming
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Rotating schedules
- Telephone operator scheduling with a fixed number of operators
- Working set generation methods for labor tour scheduling
- A microcomputer-based heuristic for tour scheduling of a mixed workforce
- Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
- Sufficient Working Subsets for the Tour Scheduling Problem
- Off-Day Scheduling with Hierarchical Worker Categories
- A Heuristic Scheduling Algorithm
- A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
- Workforce Scheduling with Cyclic Demands and Day-Off Constraints
- Multiple-Shift Workforce Scheduling Under the 3–4 Workweek with Different Weekday and Weekend Labor Requirements
- Solving Large-Scale Tour Scheduling Problems
- A simulated annealing approach to the cyclic staff-scheduling problem
- The Operator-Scheduling Problem: A Network-Flow Approach
- Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem
This page was built for publication: A sequential integer programming method for discontinuous labor tour scheduling