Interval scheduling with economies of scale
type: Item
instance of: scholarly article
title: Interval scheduling with economies of scale
author: Christopher Muir
author: Alejandro Toriello
published in: Computers \& Operations Research
publication date: 2022-12-19T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7634098
zbMATH Keywords: interval scheduling
zbMATH Keywords: integer programming
zbMATH Keywords: column generation
zbMATH Keywords: linear programming
zbMATH Keywords: dynamic programming
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2022.106056
OpenAlex ID: W4307906698
cites work: Optimal interval scheduling with a resource constraint
cites work: Scheduling jobs with fixed start and end times
cites work: Multi-objective temporal bin packing problem: an application in cloud computing
cites work: Scheduling Split Intervals
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Acceleration of cutting-plane and column generation algorithms: Applications to network design
cites work: The \(k\)-track assignment problem
cites work: Algorithms and Computation
cites work: On the \(k\)-coloring of intervals
cites work: Clique partitioning with value-monotone submodular cost
cites work: A branch-and-price algorithm for the temporal bin packing problem
cites work: A branch-and-price algorithm for the minimum sum coloring problem
cites work: Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems
cites work: Weighted coloring: further complexity and approximability results
cites work: “Rent-or-Buy” Scheduling and Cost Coloring Problems
cites work: Q3579461
cites work: Exact weighted vertex coloring via branch-and-price
cites work: An exact algorithm for the partition coloring problem
cites work: Scheduling jobs within time windows on identical parallel machines: New model and algorithms
cites work: Clique partitioning of interval graphs with submodular costs on the cliques
cites work: Exact solution of graph coloring problems via constraint programming and column generation
cites work: An Optimal Solution for the Channel-Assignment Problem
cites work: Efficient algorithms for interval graphs and circular-arc graphs
cites work: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
cites work: Fixed interval scheduling: models, applications, computational complexity and algorithms
cites work: Improving fleet utilization for carriers by interval scheduling
cites work: A heuristic approach to the bus driver scheduling problem
cites work: A Column Generation Approach for Graph Coloring
cites work: An optimal greedy heuristic to color interval graphs
cites work: Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system
cites work: On the approximability of an interval scheduling problem
DOI: 10.1016/J.COR.2022.106056
description: scientific article; zbMATH DE number 7634098