Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5702319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximization of solution flexibility for robust shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for workshop real time scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new sufficient condition of optimality for the two-machine flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine shop scheduling: Compromise between flexibility and makespan value / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting linear extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling under uncertainty: survey and research potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximization problems in single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among single machine weighted completion time scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact parallel method for a bi-objective permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with a secondary criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to computing optimal schedules for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of heads and tails for the job-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling research after five decades / rank
 
Normal rank

Latest revision as of 08:33, 2 July 2024

scientific article
Language Label Description Also known as
English
Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
scientific article

    Statements

    Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (English)
    0 references
    0 references
    0 references
    22 December 2009
    0 references
    0 references
    disjunctive scheduling
    0 references
    flow-shop scheduling
    0 references
    flexibility
    0 references
    robustness
    0 references
    worst-case performance evaluation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references