On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6197005 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
online scheduling | |||
Property / zbMATH Keywords: online scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multipurpose machines | |||
Property / zbMATH Keywords: multipurpose machines / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
competitive analysis | |||
Property / zbMATH Keywords: competitive analysis / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
makespan | |||
Property / zbMATH Keywords: makespan / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithm \(TLS\) | |||
Property / zbMATH Keywords: algorithm \(TLS\) / rank | |||
Normal rank |
Revision as of 11:04, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines |
scientific article |
Statements
On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (English)
0 references
9 August 2013
0 references
online scheduling
0 references
multipurpose machines
0 references
competitive analysis
0 references
makespan
0 references
algorithm \(TLS\)
0 references