A matheuristic approach for the two-machine total completion time flow shop problem (Q744632): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q592470 / rank
Normal rank
 
Property / author
 
Property / author: Andrea Grosso / rank
Normal rank
 
Property / author
 
Property / author: Frederico Della Croce / rank
 
Normal rank
Property / author
 
Property / author: Andrea Grosso / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977911671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matheuristic approach for the two-machine total completion time flow shop problem / 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: A variable neighborhood search based matheuristic for nurse rostering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / 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: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for minimizing total completion time in a two-machine flow shop / 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: A comprehensive review and evaluation of permutation flowshop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem / 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: Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:44, 9 July 2024

scientific article
Language Label Description Also known as
English
A matheuristic approach for the two-machine total completion time flow shop problem
scientific article

    Statements

    A matheuristic approach for the two-machine total completion time flow shop problem (English)
    0 references
    0 references
    0 references
    0 references
    26 September 2014
    0 references
    matheuristic
    0 references
    integer programming formulation
    0 references
    0 references

    Identifiers