Optimal schedules with infinitely large stability radius∗

DOI10.1080/02331939508844080zbMath0821.90067OpenAlexW2090566402WikidataQ57634019 ScholiaQ57634019MaRDI QIDQ4836770

Svetlana A. Kravchenko, Yuri N. Sotskov, Frank Werner

Publication date: 21 June 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844080

zbMATH Keywords

necessary and sufficient conditionspolynomial timemaximum latenessdisjunctive graph modelclassical shop schedulinginfinite stability radiusoptimal makespan schedule

Mathematics Subject Classification ID

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

Related Items (8)

The stability radius of an optimal line balance with maximum efficiency for a simple assembly line ⋮ Stability of a schedule minimizing mean flow time ⋮ Optimal makespan scheduling with given bounds of processing times ⋮ Some concepts of stability analysis in combinatorial optimization ⋮ Stability of Johnson's schedule with respect to limited machine availability ⋮ Stability aspects of the traveling salesman problem based on \(k\)-best solutions ⋮ On the complexity of postoptimality analysis of \(0/1\) programs ⋮ Stability analysis of an optimal balance for an assembly line with fixed cycle time

Cites Work

• A note on two problems in connexion with graphs
• Stability of an optimal schedule
• The stability of high-speed optimal schedules
• Stability of the travelling salesman problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Optimal schedules with infinitely large stability radius^∗