Optimal schedules with infinitely large stability radius<sup>∗</sup> (Q4836770): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Frank Werner / rank
Normal rank
 
Property / author
 
Property / author: Frank Werner / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331939508844080 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090566402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stability of high-speed optimal schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of an optimal schedule / rank
 
Normal rank

Latest revision as of 14:00, 23 May 2024

scientific article; zbMATH DE number 766380
Language Label Description Also known as
English
Optimal schedules with infinitely large stability radius<sup>∗</sup>
scientific article; zbMATH DE number 766380

    Statements

    Optimal schedules with infinitely large stability radius<sup>∗</sup> (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 June 1995
    0 references
    disjunctive graph model
    0 references
    necessary and sufficient conditions
    0 references
    optimal makespan schedule
    0 references
    infinite stability radius
    0 references
    classical shop scheduling
    0 references
    maximum lateness
    0 references
    polynomial time
    0 references

    Identifiers