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

DOI10.1134/S0005117923090102MaRDI QIDQ6148285zbMATH OpenFDO

Authors E. G. Musatova, Alexander A. Lazarev

Publication date 11 January 2024

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

Full work available at URL https://doi.org/10.1134/S0005117923090102

zbMATH Keywords

downtime of resources minimizationNP-hard problemsscheduling theorysingle machine problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• scientific article; zbMATH DE number 3894817
• Single Machine Scheduling with Series-Parallel Precedence Constraints
• Single machine scheduling problem with minimize total weighted early work
• Minimizing Total Tardiness on a Single Machine with Precedence Constraints

Cites work

• An algorithm for the single machine sequencing problem with precedence constraints
• Complexity of Scheduling under Precedence Constraints
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Minimization of the weighted total sparsity of cosmonaut training courses
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling algorithms

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

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