Interval scheduling with economies of scale
From MaRDI portal
Publication:2108158
DOI10.1016/j.cor.2022.106056OpenAlexW4307906698MaRDI QIDQ2108158
Christopher Muir, Alejandro Toriello
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106056
linear programmingheuristicsinteger programmingdynamic programmingcolumn generationinterval scheduling
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal interval scheduling with a resource constraint
- Improving fleet utilization for carriers by interval scheduling
- Exact weighted vertex coloring via branch-and-price
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- An optimal greedy heuristic to color interval graphs
- Weighted coloring: further complexity and approximability results
- A heuristic approach to the bus driver scheduling problem
- 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
- An exact algorithm for the partition coloring problem
- On the approximability of an interval scheduling problem
- On the \(k\)-coloring of intervals
- A branch-and-price algorithm for the minimum sum coloring problem
- A branch-and-price algorithm for the temporal bin packing problem
- Clique partitioning with value-monotone submodular cost
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Multi-objective temporal bin packing problem: an application in cloud computing
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
- Clique partitioning of interval graphs with submodular costs on the cliques
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- An Optimal Solution for the Channel-Assignment Problem
- Efficient algorithms for interval graphs and circular-arc graphs
- A Column Generation Approach for Graph Coloring
- Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system
- “Rent-or-Buy” Scheduling and Cost Coloring Problems
- Scheduling Split Intervals
- Algorithms and Computation
This page was built for publication: Interval scheduling with economies of scale
