Minimization of the weighted total sparsity of cosmonaut training courses

DOI10.1007/978-3-030-10934-9_15zbMATH Open1465.90113OpenAlexW2911093639MaRDI QIDQ2026164FDOQ2026164

Authors: Nail Khusnullin, Elena Musatova, Denis Yadrentsev, Maxim Kharlamov, K. N. Ponomarëv, Alexander A. Lazarev 

Publication date: 18 May 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-10934-9_15

Recommendations

• Maximizing the value of a space mission
• Class Scheduling for Pilot Training
• Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators
• Resource tardiness weighted cost minimization in project scheduling
• On project scheduling problem

zbMATH Keywords

planningpriority ruleheuristic algorithmsresource-constrained project scheduling problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cited In (1)

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

Uses Software

• CPLEX

This page was built for publication: Minimization of the weighted total sparsity of cosmonaut training courses

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