Optimal interval scheduling with a resource constraint
From MaRDI portal
Publication:337149
DOI10.1016/J.COR.2014.06.002zbMATH Open1348.90239OpenAlexW1972086438MaRDI QIDQ337149FDOQ337149
Nicola Bianchessi, Enrico Angelelli, Carlo Filippi
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.002
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Scheduling jobs with fixed start and end times
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Branch-and-price: Column generation for solving huge integer programs
- Truthful Mechanisms via Greedy Iterative Packing
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Interval scheduling: A survey
- An analysis of approximations for maximizing submodular set functions—I
- Column Generation
- Optimal solutions for routing problems with profits
- Column generation based primal heuristics
- On the computational complexity of (maximum) class scheduling
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Interval scheduling on identical machines
- An Optimal Solution for the Channel-Assignment Problem
- Games of Boldness, Where the Player Performing the Hardest Task Wins
- Minimal Resources for Fixed and Variable Job Schedules
- The Temporal Knapsack Problem and Its Solution
- A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
- A logarithmic approximation for unsplittable flow on line graphs
- On the complexity of interval scheduling with a resource constraint
- Theoretical Computer Science
- Resource allocation with time intervals
- Approximation algorithms for the unsplittable flow problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (19)
- On the parameterized complexity of interval scheduling with eligible machine sets
- Interval scheduling with economies of scale
- Strategy-proof mechanism for online resource allocation in cloud and edge collaboration
- Title not available (Why is that?)
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
- Optimal scheduling of slots with season segmentation
- Optimal behavior and concurrent variable interval schedules
- Scheduling with constrained processor allocation for interval orders
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms
- Fixed interval scheduling with third‐party machines
- Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
- Flow-based formulations for operational fixed interval scheduling problems with random delays
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- A combinatorial flow-based formulation for temporal bin packing problems
- Title not available (Why is that?)
- Visiting infinitely often the unit interval while minimizing the idle time of high priority segments
- Mobility offer allocations in corporate settings
- A branch-and-price algorithm for the temporal bin packing problem
- A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes
This page was built for publication: Optimal interval scheduling with a resource constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337149)
