A new integer programming formulation for the permutation flowshop problem (Q1121163): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alan M. Frieze / rank
Normal rank
 
Property / author
 
Property / author: Alan M. Frieze / rank
 
Normal rank
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.1016/0377-2217(89)90276-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015411036 / 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: Q3964287 / 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: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Q4178782 / 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 ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Bounding Scheme for the Permutation Flow-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive branching rule for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Algorithm for Solution of the <i>n</i>-Job, <i>M</i>-Machine Sequencing Problem of the Flow Shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination methods in them ×n sequencing problem / rank
 
Normal rank

Latest revision as of 15:31, 19 June 2024

scientific article
Language Label Description Also known as
English
A new integer programming formulation for the permutation flowshop problem
scientific article

    Statements

    A new integer programming formulation for the permutation flowshop problem (English)
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    assignment
    0 references
    heuristic
    0 references
    graphs
    0 references
    permutation flowshop
    0 references
    minimise the makespan
    0 references
    exponential number of constraints
    0 references
    linear programming relaxation
    0 references
    polynomial time
    0 references
    computational experience
    0 references
    0 references
    0 references