Minimizing the total weighted duration of courses in a single machine problem with precedence constraints

DOI10.1134/s0005117923090102zbMath1530.90042MaRDI QIDQ6148285

Alexander A. Lazarev, E. G. Musatova

Publication date: 11 January 2024

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

scheduling theoryNP-hard problemssingle machine problemdowntime of resources minimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Minimization of the weighted total sparsity of cosmonaut training courses
• An algorithm for the single machine sequencing problem with precedence constraints
• Complexity of Scheduling under Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing the total weighted duration of courses in a single machine problem with precedence constraints