Working time constraints in operational fixed job scheduling
From MaRDI portal
Publication:3163130
DOI10.1080/00207540903289771zbMath1197.90204OpenAlexW1965220081MaRDI QIDQ3163130
Azizoglu, Meral, Deniz Türsel Eliiyi
Publication date: 25 October 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540903289771
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem ⋮ Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals ⋮ Tactical fixed job scheduling with spread-time constraints
Cites Work
- Approximation algorithms for time constrained scheduling
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A heuristic approach to the bus driver scheduling problem
- On the computational complexity of (maximum) class scheduling
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- On the approximability of an interval scheduling problem
- Algorithmic graph theory and perfect graphs
- Interval scheduling on identical machines
- Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
- Spread time considerations in operational fixed job scheduling
- Interval scheduling: A survey
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Fixed Job Schedule Problem with Working-Time Constraints
- Approximation Algorithms for Fixed Job Schedule Problems
- A Greedy On-Line Algorithm for thek-Track Assignment Problem
- Unnamed Item