A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Daniel Tuyttens / rank
Normal rank
 
Property / author
 
Property / author: Daniel Tuyttens / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3001967193 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126289529 / 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: Two branch and bound algorithms for the permutation flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation / 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: A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop-scheduling problems with makespan criterion: a review / 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: An empirical analysis of the optimality rate of flow shop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of the permutation flow shop problem based on a tight lower bound / 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: An exact parallel method for a bi-objective permutation flowshop problem / 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: Fifty years of scheduling: a survey of milestones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Elimination Methods in the <i>m</i> × <i>n</i> Flow-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hard benchmark for flowshop scheduling problems minimising makespan / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:44, 22 July 2024

scientific article
Language Label Description Also known as
English
A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
scientific article

    Statements

    A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 May 2020
    0 references
    branch-and-bound
    0 references
    flowshop
    0 references
    makespan
    0 references
    parallel computing
    0 references
    0 references

    Identifiers

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