On the approximability of an interval scheduling problem
type: Item
instance of: scholarly article
title: On the approximability of an interval scheduling problem
zbMATH Open document ID: 0938.90034
author: Frits C. R. Spieksma
published in: Journal of Scheduling
publication date: 1999-11-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1356648
zbMATH Keywords: approximability
zbMATH Keywords: independent set
zbMATH Keywords: greedy algorithm
MaRDI profile type: Publication
cites work: Q3328583
cites work: When Is the Classroom Assignment Problem Hard?
cites work: Approximation Algorithms for Fixed Job Schedule Problems
cites work: Q4395326
cites work: Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
cites work: Complexity results for scheduling tasks with discrete starting times
cites work: On the complexity of scheduling tasks with discrete starting times
cites work: The assembly of printed circuit boards: A case with multiple machines and multiple board types
cites work: Q3840371
cites work: Q4298260
cites work: Q4230322
cites work: Note on scheduling intervals on-line
DOI: 10.1002/(SICI)1099-1425(199909/10)2:5%3C215::AID-JOS27%3E3.0.CO;2-Y
description: scientific article; zbMATH DE number 1356648