Decomposition algorithms for the interval scheduling problem
From MaRDI portal
Recommendations
- Railway scheduling problems and their decomposition.
- The k-track assignment problem
- Optimizing schedules of rail train circulations by tabu search algorithm
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem
Cites work
- A greedy genetic algorithm for the quadratic assignment problem
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Interval selection: Applications, algorithms, and lower bounds
- On the approximability of an interval scheduling problem
- Scheduling jobs with fixed start and end times
- Scheduling jobs within time windows on identical parallel machines: New model and algorithms
- The k-track assignment problem
- The k-Track assignment problem on partial orders
Cited in
(2)
This page was built for publication: Decomposition algorithms for the interval scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3052722)
