Interval scheduling with economies of scale
From MaRDI portal
Publication:2108158
Recommendations
Cites work
- “Rent-or-Buy” Scheduling and Cost Coloring Problems
- A branch-and-price algorithm for the minimum sum coloring problem
- A branch-and-price algorithm for the temporal bin packing problem
- A Column Generation Approach for Graph Coloring
- A heuristic approach to the bus driver scheduling problem
- Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Algorithms and Computation
- Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system
- An exact algorithm for the partition coloring problem
- An optimal greedy heuristic to color interval graphs
- An Optimal Solution for the Channel-Assignment Problem
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Branch-and-price: Column generation for solving huge integer programs
- Clique partitioning of interval graphs with submodular costs on the cliques
- Clique partitioning with value-monotone submodular cost
- Efficient algorithms for interval graphs and circular-arc graphs
- Exact solution of graph coloring problems via constraint programming and column generation
- Exact weighted vertex coloring via branch-and-price
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- scientific article; zbMATH DE number 5764868 (Why is no real title available?)
- Improving fleet utilization for carriers by interval scheduling
- Multi-objective temporal bin packing problem: an application in cloud computing
- On the \(k\)-coloring of intervals
- On the approximability of an interval scheduling problem
- Optimal interval scheduling with a resource constraint
- Scheduling jobs with fixed start and end times
- Scheduling jobs within time windows on identical parallel machines: New model and algorithms
- Scheduling Split Intervals
- The k-track assignment problem
- Weighted coloring: further complexity and approximability results
Cited in
(4)
This page was built for publication: Interval scheduling with economies of scale
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108158)