Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589): 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: 90C29 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6651740 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
total weighted completion time
Property / zbMATH Keywords: total weighted completion time / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum lateness
Property / zbMATH Keywords: maximum lateness / rank
 
Normal rank
Property / zbMATH Keywords
 
two agents
Property / zbMATH Keywords: two agents / rank
 
Normal rank

Revision as of 05:53, 28 June 2023

scientific article
Language Label Description Also known as
English
Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
scientific article

    Statements

    Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2016
    0 references
    scheduling
    0 references
    total weighted completion time
    0 references
    maximum lateness
    0 references
    two agents
    0 references

    Identifiers