Non-preemptive scheduling with setup times: a PTAS
type: Item
instance of: scholarly article
title: Non-preemptive scheduling with setup times: a PTAS
zbMATH Open document ID: 1377.68055
DOI: 10.1007/978-3-319-43659-3_12
author: Klaus Jansen
author: F. Land
publication date: 2018-01-11T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6824360
zbMATH Keywords: scheduling
zbMATH Keywords: setup times
zbMATH Keywords: makespan minimization
zbMATH Keywords: approximation algorithms
zbMATH Keywords: polynomial time approximation schemes
MaRDI profile type: Publication
full work available at URL: 978-3-319-43659-3 12
OpenAlex ID: W2525690743
Recommended article: Non-preemptive Scheduling on Machines with Setup Times
Recommended article: Nonpreemptive scheduling of independent tasks with prespecified processor allocations
Recommended article: Q4515625
Recommended article: A heuristic for preemptive scheduling with set-up times
Recommended article: Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
Recommended article: The non-preemptive scheduling of periodic tasks upon multiprocessors
Recommended article: Nonpreemptive scheduling of arbitrary machines
Recommended article: Non-preemptive scheduling to maximize the minimum global inter-completion time
Recommended article: Empowering the configuration-IP: new PTAS results for scheduling with setup times
description: scientific article; zbMATH DE number 6824360