A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem (Q4849290): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sunderesh S. Heragu / rank
Normal rank
 
Property / author
 
Property / author: Sunderesh S. Heragu / 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.1057/jors.1995.102 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011813554 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:52, 19 March 2024

scientific article; zbMATH DE number 800657
Language Label Description Also known as
English
A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
scientific article; zbMATH DE number 800657

    Statements

    A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 1995
    0 references
    0 references
    computational analysis
    0 references
    branch-and-bound
    0 references
    two-machine flow shop scheduling
    0 references
    simulated annealing
    0 references
    tabu search
    0 references
    genetic algorithms
    0 references
    0 references