Tactical fixed job scheduling with spread-time constraints
From MaRDI portal
Publication:337014
DOI10.1016/j.cor.2014.02.001zbMath1348.90339arXiv1402.1881OpenAlexW2170425807MaRDI QIDQ337014
Xiandong Zhang, Shuyu Zhou, Bo Chen, Steef L. van de Velde
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.1881
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem ⋮ Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
Uses Software
Cites Work
- An effective and simple heuristic for the set covering problem
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach
- A heuristic approach to the bus driver scheduling problem
- License class design: Complexity and algorithms
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- A branch-and-price approach to \(p\)-median location problems
- Scheduling trainees at a hospital department using a branch-and-price approach
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
- Working time constraints in operational fixed job scheduling
- A fixed job scheduling problem with machine-dependent job weights
- Spread time considerations in operational fixed job scheduling
- Interval scheduling: A survey
- The Fixed Job Schedule Problem with Spread-Time Constraints
- An Optimal Solution for the Channel-Assignment Problem
- Approximation Algorithms for Fixed Job Schedule Problems
- Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
- Principles on the Benefits of Manufacturing Process Flexibility
- A Heuristic Method for the Set Covering Problem
- Algorithms for the set covering problem
