Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity (Q4380542): 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: Q170700 / rank
Normal rank
 
Property / author
 
Property / author: Chelliah Skriskandarajah / rank
Normal rank
 
Property / author
 
Property / author: Steef L. van de Velde / rank
Normal rank
 
Property / author
 
Property / author: Suresh P. Sethi / rank
 
Normal rank
Property / author
 
Property / author: Chelliah Skriskandarajah / rank
 
Normal rank
Property / author
 
Property / author: Steef L. van de Velde / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1501009594 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:14, 20 March 2024

scientific article; zbMATH DE number 1129407
Language Label Description Also known as
English
Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
scientific article; zbMATH DE number 1129407

    Statements

    Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity (English)
    0 references
    0 references
    0 references
    0 references
    7 September 1998
    0 references
    0 references
    flowshop scheduling
    0 references
    makespan
    0 references
    0 references