single Machine Preemptive Scheduling With Special Cost Functions1

DOI10.1080/02331939508844112zbMath0857.90054OpenAlexW2008264814WikidataQ57634024 ScholiaQ57634024MaRDI QIDQ4888275

E. Azharonok, Frank Werner, Valery S. Gordon

Publication date: 30 October 1996

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844112

zbMATH Keywords

parallel algorithmssingle machine schedulingprecedence constraintspolynomial time algorithmspreemption

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Binary Trees and Parallel Scheduling Algorithms
• Parallel Matrix and Graph Algorithms
• Parallel Scheduling Algorithms
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: single Machine Preemptive Scheduling With Special Cost Functions¹