Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times (Q6050626): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1051/ro/2023091 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4380610780 / rank
 
Normal rank

Latest revision as of 11:25, 30 July 2024

scientific article; zbMATH DE number 7739644
Language Label Description Also known as
English
Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times
scientific article; zbMATH DE number 7739644

    Statements

    Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times (English)
    0 references
    0 references
    0 references
    0 references
    19 September 2023
    0 references
    0 references
    scheduling
    0 references
    flowshop
    0 references
    makespan
    0 references
    algorithm
    0 references
    uncertain processing times
    0 references
    0 references