An exact parallel method for a bi-objective permutation flowshop problem (Q857297): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56920658, #quickstatements; #temporary_batch_1712261475387
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Proper efficiency and the theory of vector maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / 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: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria approach to the two-machine flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for scheduling in flowshop with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple and bicriteria scheduling: A literature survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria two-machine permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Bounding Scheme for the Permutation Flow-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness in permutation flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank

Revision as of 10:40, 25 June 2024

scientific article
Language Label Description Also known as
English
An exact parallel method for a bi-objective permutation flowshop problem
scientific article

    Statements

    An exact parallel method for a bi-objective permutation flowshop problem (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2006
    0 references
    exact method
    0 references
    parallel method
    0 references
    bi-objective combinatorial optimization problem
    0 references
    permutation flowshop
    0 references

    Identifiers