An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Marco Ghirardi / rank
Normal rank
 
Property / author
 
Property / author: Marco Ghirardi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling to minimize mean flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized pairwise interchanges and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine total completion time flow shop 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(01)00374-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034737492 / rank
 
Normal rank

Latest revision as of 09:24, 30 July 2024

scientific article
Language Label Description Also known as
English
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references