Spread time considerations in operational fixed job scheduling
From MaRDI portal
Publication:3432669
DOI10.1080/00207540500478645zbMath1141.90425OpenAlexW2022308156MaRDI QIDQ3432669
Azizoglu, Meral, Deniz Türsel Eliiyi
Publication date: 18 April 2007
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540500478645
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
Working time constraints in operational fixed job scheduling ⋮ A fixed job scheduling problem with machine-dependent job weights ⋮ Tactical fixed job scheduling with spread-time constraints ⋮ A metaheuristic for the fixed job scheduling problem under spread time constraints ⋮ Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
Cites Work
- Unnamed Item
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- Interval scheduling on identical machines
- Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
- The Fixed Job Schedule Problem with Spread-Time Constraints
- Approximation Algorithms for Fixed Job Schedule Problems
This page was built for publication: Spread time considerations in operational fixed job scheduling