A heuristic for preemptive scheduling with set-up times

DOI10.1007/BF02238747zbMath0773.90039MaRDI QIDQ1202243

Zhongliang Yu, Gerhard J. Woeginger

Publication date: 25 February 1993

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

heuristicspolynomial time approximation algorithmNP-completepreemptive schedulingidentical parallel machines\(m\) parallel machinesconstant (job- and machine-independent) set-up timesworst- case analysis

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Strategic Scheduling Games: Equilibria and Efficiency

Cites Work

• Unnamed Item
• Time bounds for selection
• Scheduling with Deadlines and Loss Functions
• Performance Guarantees for Scheduling Algorithms
• On the Complexity of Scheduling with Batch Setup Times
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: A heuristic for preemptive scheduling with set-up times