The just-in-time scheduling problem in a flow-shop scheduling system (Q421784): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6035165 / rank
 
Normal rank
Property / zbMATH Keywords
 
just-in-time scheduling
Property / zbMATH Keywords: just-in-time scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
flow-shop
Property / zbMATH Keywords: flow-shop / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
pseudo-polynomial time algorithm
Property / zbMATH Keywords: pseudo-polynomial time algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
no-wait restriction
Property / zbMATH Keywords: no-wait restriction / rank
 
Normal rank

Revision as of 20:50, 29 June 2023

scientific article
Language Label Description Also known as
English
The just-in-time scheduling problem in a flow-shop scheduling system
scientific article

    Statements

    The just-in-time scheduling problem in a flow-shop scheduling system (English)
    0 references
    0 references
    14 May 2012
    0 references
    just-in-time scheduling
    0 references
    flow-shop
    0 references
    complexity
    0 references
    pseudo-polynomial time algorithm
    0 references
    no-wait restriction
    0 references

    Identifiers