Scheduling open shops with parallel machines to minimize total completion time (Q609214): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cam.2010.08.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039632218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of exact solution methods for the non-preemptive multiprocessor flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time approximation scheme for the multiprocessor open shop 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: A memetic algorithm for the flexible flow line scheduling problem with processor blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative evaluation of MILP flowshop models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new particle swarm optimization for the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Solving Production-Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling flexible flow lines with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives / rank
 
Normal rank

Latest revision as of 12:21, 3 July 2024

scientific article
Language Label Description Also known as
English
Scheduling open shops with parallel machines to minimize total completion time
scientific article

    Statements

    Scheduling open shops with parallel machines to minimize total completion time (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2010
    0 references
    scheduling
    0 references
    open shop
    0 references
    parallel machines
    0 references
    mathematical model
    0 references
    mixed integer linear programming
    0 references
    memetic algorithm
    0 references
    Taguchi method
    0 references

    Identifiers