Flow shop-sequencing problem with synchronous transfers and makespan minimization (Q5438669): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207540600621672 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064741724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Flow-Shop Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lessons of Flowshop Scheduling Research / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective / 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: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank

Latest revision as of 15:55, 27 June 2024

scientific article; zbMATH DE number 5229852
Language Label Description Also known as
English
Flow shop-sequencing problem with synchronous transfers and makespan minimization
scientific article; zbMATH DE number 5229852

    Statements

    Flow shop-sequencing problem with synchronous transfers and makespan minimization (English)
    0 references
    0 references
    0 references
    0 references
    24 January 2008
    0 references
    0 references
    flow shops
    0 references
    scheduling
    0 references
    makespan
    0 references
    branch-and-bound
    0 references
    0 references