An iterative improvement approach for the nonpreemptive open shop scheduling problem (Q1806862): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Open-shop scheduling problems with dominated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Three-Machine Open Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Open-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841579 / rank
 
Normal rank

Latest revision as of 09:03, 29 May 2024

scientific article
Language Label Description Also known as
English
An iterative improvement approach for the nonpreemptive open shop scheduling problem
scientific article

    Statements

    An iterative improvement approach for the nonpreemptive open shop scheduling problem (English)
    0 references
    0 references
    14 June 2000
    0 references
    scheduling theory
    0 references
    Bender's decomposition
    0 references
    sequencing
    0 references
    makespan
    0 references

    Identifiers