Solvable Cases of the No-wait Flow-shop Scheduling Problem (Q3984309): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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.1038/sj/jors/0421105 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4243078096 / rank
 
Normal rank

Latest revision as of 21:28, 19 March 2024

scientific article
Language Label Description Also known as
English
Solvable Cases of the No-wait Flow-shop Scheduling Problem
scientific article

    Statements

    Solvable Cases of the No-wait Flow-shop Scheduling Problem (English)
    0 references
    0 references
    27 June 1992
    0 references
    no-wait flow-shop scheduling
    0 references
    makespan objective function
    0 references
    travelling salesman
    0 references
    polynomial solvable cases
    0 references
    semi-ordered processing times
    0 references
    mean objective function
    0 references

    Identifiers

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