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

DOI10.1007/BF01460278zbMath0509.90047MaRDI QIDQ1838906

K. V. Shakhbazyan

Publication date: 1983

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

zbMATH Keywords

polynomial solvabilityone-processor scheduling

Mathematics Subject Classification ID

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

Related Items (1)

Structural scheduling in the problems of scheduling theory

Cites Work

• Structural scheduling in the problems of scheduling theory
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling theory problems of type \(n|1|\sum c_i(t)\)