DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM
From MaRDI portal
Publication:3052722
DOI10.1142/S0217595910002831zbMath1197.90236MaRDI QIDQ3052722
Li Zheng, Shidong Wang, Zhi-Hai Zhang
Publication date: 1 November 2010
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Unnamed Item
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Scheduling jobs with fixed start and end times
- The \(k\)-track assignment problem
- Scheduling jobs within time windows on identical parallel machines: New model and algorithms
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- A greedy genetic algorithm for the quadratic assignment problem
- On the approximability of an interval scheduling problem
- The \(k\)-Track assignment problem on partial orders
- Interval selection: Applications, algorithms, and lower bounds