Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q367227
Created claim: DBLP publication ID (P1635): journals/cor/LemesreDT07, #quickstatements; #temporary_batch_1731543907597
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Clarisse Dhaenens / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966898882 / 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: Q4889471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved genetic algorithm for the permutation flowshop scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of heuristics for flowtime minimisation in permutation flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation flowshop scheduling problems with maximal and minimal time lags / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / 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: An exact parallel method for a bi-objective permutation flowshop problem / 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: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/cor/LemesreDT07 / rank
 
Normal rank

Latest revision as of 01:31, 14 November 2024

scientific article
Language Label Description Also known as
English
Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
scientific article

    Statements

    Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (English)
    0 references
    0 references
    0 references
    0 references
    26 February 2007
    0 references
    exact method
    0 references
    Bi-objective problem
    0 references
    permutation flowshop
    0 references

    Identifiers