Worst-case analysis of heuristics for open shops with parallel machines (Q1310023): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3496142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound algorithm for the flow shop with multiple processors / 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: Q4099211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for the Multifit Processor Scheduling Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of a MULTIFIT-based scheduling algorithm / 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: No-wait shop scheduling: Computational complexity and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage, Hybrid Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling open shops with parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling algorithms for flexible flowshops: Worst and average case performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank

Latest revision as of 12:07, 22 May 2024

scientific article
Language Label Description Also known as
English
Worst-case analysis of heuristics for open shops with parallel machines
scientific article

    Statements

    Worst-case analysis of heuristics for open shops with parallel machines (English)
    0 references
    0 references
    0 references
    20 December 1993
    0 references
    0 references
    multi-stage open shop scheduling
    0 references
    identical parallel machines
    0 references
    makespan
    0 references
    heuristic algorithms
    0 references
    worst-case performance
    0 references