Structural scheduling in the problems of scheduling theory

DOI10.1007/BF01460277zbMath0509.90049OpenAlexW2023467786MaRDI QIDQ1838908

K. V. Shakhbazyan

Publication date: 1983

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01460277

zbMATH Keywords

polynomial algorithmmultiprocessor systemsNP-hard problemsstructured scheduling problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Processes with alternating activities ⋮ Scheduling theory problems of type \(n|1|\sum c_i(t)\)

Cites Work

• Scheduling theory problems of type \(n|1|\sum c_i(t)\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Structural scheduling in the problems of scheduling theory