Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem

DOI10.1287/OPRE.45.4.624MaRDI QIDQ4363763zbMATH OpenOpenAlexFDO

Authors Leo Kroon, Marc Salomon, 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

zbMATH Keywords

parallel nonidentical machinestactical fixed interval scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Interval scheduling on identical machines
• Tactical fixed job scheduling with spread-time constraints
• scientific article; zbMATH DE number 15416

Cited in

(24)

• Improving fleet utilization for carriers by interval scheduling
• Algorithms for large scale shift minimisation personnel task scheduling problems
• A classification scheme for integrated staff rostering and scheduling problems
• An exact approach for the personnel task rescheduling problem with task retiming
• Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
• Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
• Flow-based formulations for operational fixed interval scheduling problems with random delays
• A greedy heuristic for shift minimization personnel task scheduling problem
• Two-machine interval shop scheduling with time lags
• Personnel scheduling: models and complexity
• Tactical fixed job scheduling with spread-time constraints
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Minimizing the number of machines for scheduling jobs with equal processing times
• Minimizing the number of machines for minimum length schedules
• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
• On the approximability of an interval scheduling problem
• Mobility offer allocations in corporate settings
• Employee positioning and workload allocation
• Inverse interval scheduling via reduction on a single machine
• Fixed order scheduling with deadlines
• A triplet-based exact method for the shift minimisation personnel task scheduling problem

This page was built for publication: Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363763)