On the complexity of interval scheduling with a resource constraint
type: Item
instance of: scholarly article
title: On the complexity of interval scheduling with a resource constraint
zbMATH Open document ID: 1234.90005
author: Enrico Angelelli
author: Carlo Filippi
published in: Theoretical Computer Science
publication date: 2011-07-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5920442
zbMATH Keywords: scheduling
zbMATH Keywords: fixed job scheduling
zbMATH Keywords: resource allocation
zbMATH Keywords: complexity
zbMATH Keywords: interval availability
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.03.025
OpenAlex ID: W1982134276
cites work: Scheduling jobs with fixed start and end times
cites work: A logarithmic approximation for unsplittable flow on line graphs
cites work: Interval scheduling on identical machines
cites work: Q3236250
cites work: Resource allocation with time intervals
cites work: Games of Boldness, Where the Player Performing the Hardest Task Wins
cites work: Q4198056
cites work: The Complexity of Coloring Circular Arcs and Chords
cites work: Minimal Resources for Fixed and Variable Job Schedules
cites work: An Optimal Solution for the Channel-Assignment Problem
cites work: Theoretical Computer Science
cites work: On the Computational Complexity of Combinatorial Problems
cites work: On the computational complexity of (maximum) class scheduling
cites work: Interval scheduling: A survey
cites work: Fixed interval scheduling: models, applications, computational complexity and algorithms
cites work: Exact and approximation algorithms for the operational fixed interval scheduling problem
cites work: Q3780409
DOI: 10.1016/J.TCS.2011.03.025
description: scientific article; zbMATH DE number 5920442