Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2011.08.009 / rank
Normal rank
 
Property / cites work
 
Property / cites work: An ant colony system for permutation flow-shop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem / 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: Multicriteria scheduling problems: a survey / 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 multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3607719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2011.08.009 / rank
 
Normal rank

Latest revision as of 14:41, 9 December 2024

scientific article
Language Label Description Also known as
English
Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
scientific article

    Statements

    Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    flowshop scheduling
    0 references
    bi-objective
    0 references
    makespan
    0 references
    total flowtime
    0 references

    Identifiers