Non-preemptive scheduling with setup times: a PTAS

DOI10.1007/978-3-319-43659-3_12zbMath1377.68055OpenAlexW2525690743MaRDI QIDQ1693204

Klaus Jansen, Felix Land

Publication date: 11 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-43659-3_12

zbMATH Keywords

schedulingmakespan minimizationapproximation algorithmssetup timespolynomial time approximation schemes

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (2)

Unnamed Item ⋮ Empowering the configuration-IP: new PTAS results for scheduling with setup times

This page was built for publication: Non-preemptive scheduling with setup times: a PTAS