On number of optimal solutions in some scheduling problems

zbMATH Open1472.90114MaRDI QIDQ5004802FDOQ5004802

Authors: Badri Mamporia, Z. Sanikidze, Nodari Vakhania 

Publication date: 3 August 2021

Recommendations

• scientific article; zbMATH DE number 1150206
• Optimal schedules for problems with various routes
• k-optimal solution sets for some polynomially solvable scheduling problems
• scientific article; zbMATH DE number 4125190
• Necessary and sufficient conditions of optimality for some classical scheduling problems

zbMATH Keywords

combinatorial optimizationscheduling theory

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cited In (10)

• On the meaningfulness of optimal solutions to scheduling problems: Can an optimal solution be nonoptimal?
• k-optimal solution sets for some polynomially solvable scheduling problems
• Necessary and sufficient conditions of optimality for some classical scheduling problems
• Optimal schedules for problems with various routes
• Reducing the solution space of optimal task scheduling
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On number of optimal solutions in some scheduling problems

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