The power of \(\alpha\)-points in preemptive single machine scheduling.
type: Item
instance of: scholarly article
title: The power of \(\alpha\)-points in preemptive single machine scheduling.
zbMATH Open document ID: 1038.90037
author: Andreas S. Schulz
author: Martin Skutella
published in: Journal of Scheduling
publication date: 2003-07-27T00:00:00Z
full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15940
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 1751676
zbMATH Keywords: scheduling theory
zbMATH Keywords: approximation algorithm
zbMATH Keywords: on-line algorithm
zbMATH Keywords: randomized algorithm
zbMATH Keywords: LP relaxation
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
OpenAlex ID: W2126520302
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4223058
cites work: Q4818873
cites work: Q5501840
cites work: Q5501838
cites work: Q4875178
cites work: Approximation and randomization in scheduling
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: A 1. 47-approximation for a preemptive single-machine scheduling problem
cites work: Some simple scheduling algorithms
cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program
cites work: A Sequencing Problem with Release Dates and Clustered Jobs
cites work: Q4779156
cites work: Q4828982
DOI: 10.1002/JOS.93
description: scientific article; zbMATH DE number 1751676