Sufficient Working Subsets for the Tour Scheduling Problem

DOI10.1287/mnsc.37.11.1441zbMath0729.91021OpenAlexW1988249480MaRDI QIDQ3356092

Fred F. Easton, Donald F. Rossin

Publication date: 1991

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.37.11.1441

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Working set generation methods for labor tour scheduling ⋮ A mixed integer programming approach to multi-skilled workforce scheduling ⋮ A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs ⋮ A microcomputer-based heuristic for tour scheduling of a mixed workforce ⋮ A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives ⋮ Balancing staffing and switching costs in a service center with flexible servers ⋮ Scheduling workforce relief breaks in advance versus in real-time ⋮ Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations ⋮ Unnamed Item ⋮ An online approach to dynamic rescheduling for production planning applications ⋮ 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 ⋮ A genetic algorithm for scheduling staff of mixed skills under multi-criteria ⋮ Variable employee productivity in workforce scheduling