Non-preemptive scheduling with setup times: a PTAS

DOI10.1007/978-3-319-43659-3_12MaRDI QIDQ1693204zbMATH OpenOpenAlexFDO

Authors Klaus Jansen, F. Land

Publication date 11 January 2018

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

zbMATH Keywords

approximation algorithmsmakespan minimizationpolynomial time approximation schemesschedulingsetup times

Mathematics Subject Classification ID

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

Recommendations

• Non-preemptive scheduling on machines with setup times
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• scientific article; zbMATH DE number 1529456
• A heuristic for preemptive scheduling with set-up times
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• Nonpreemptive scheduling of arbitrary machines
• Non-preemptive scheduling to maximize the minimum global inter-completion time
• Empowering the configuration-IP: new PTAS results for scheduling with setup times

Cited in

(7)

• A heuristic for preemptive scheduling with set-up times
• Non-approximability of precedence-constrained sequencing to minimize setups.
• On non-preemptive scheduling of recurring tasks using inserted idle times
• Empowering the configuration-IP: new PTAS results for scheduling with setup times
• Non-preemptive scheduling on machines with setup times
• Empowering the configuration-IP -- new PTAS results for scheduling with setups times
• The fourth comprehensive review of scheduling problems with setup times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693204)