Sensitivity analysis for some scheduling problems (Q3538478): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sensitivity analysis of list scheduling heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling to minimize makespan on a changing number of identical processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis for scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with due-dates and early start times to minimize maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with dominant machines / rank
 
Normal rank

Latest revision as of 20:56, 28 June 2024

scientific article
Language Label Description Also known as
English
Sensitivity analysis for some scheduling problems
scientific article

    Statements

    Sensitivity analysis for some scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2008
    0 references
    0 references
    scheduling
    0 references
    sensitivity analysis
    0 references
    single machine
    0 references
    flowshop
    0 references
    0 references