Structural scheduling in the problems of scheduling theory

DOI10.1007/BF01460277MaRDI QIDQ1838908zbMATH OpenOpenAlexFDO

Authors 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

NP-hard problemspolynomial algorithmmultiprocessor systemsstructured scheduling problems

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3642701 (Why is no real title available?)
• scientific article; zbMATH DE number 3711735 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3633982 (Why is no real title available?)
• Scheduling theory problems of type \(n|1|\sum c_i(t)\)

Cited in

(2)

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

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

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