Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
From MaRDI portal
Publication:4363763
DOI10.1287/opre.45.4.624zbMath0887.90089OpenAlexW1976936136MaRDI QIDQ4363763
Marc Salomon, Leo G. Kroon, Luk N. Van Wassenhove
Publication date: 2 June 1998
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1765/14327
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (22)
A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem ⋮ Employee positioning and workload allocation ⋮ Tactical fixed job scheduling with spread-time constraints ⋮ Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Inverse interval scheduling via reduction on a single machine ⋮ History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence ⋮ Two-machine interval shop scheduling with time lags ⋮ Mobility offer allocations in corporate settings ⋮ Improving fleet utilization for carriers by interval scheduling ⋮ Algorithms for large scale shift minimisation personnel task scheduling problems ⋮ Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem ⋮ An exact approach for the personnel task rescheduling problem with task retiming ⋮ Personnel scheduling: models and complexity ⋮ A greedy heuristic for shift minimization personnel task scheduling problem ⋮ Flow-based formulations for operational fixed interval scheduling problems with random delays ⋮ Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm ⋮ On the approximability of an interval scheduling problem ⋮ Minimizing the number of machines for scheduling jobs with equal processing times ⋮ Minimizing the number of machines for minimum length schedules ⋮ A classification scheme for integrated staff rostering and scheduling problems
This page was built for publication: Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
