Semi-online scheduling with bounded job sizes on two uniform machines (Q338376): 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: 6647908 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling | |||
Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
uniform machines | |||
Property / zbMATH Keywords: uniform machines / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
semi-online | |||
Property / zbMATH Keywords: semi-online / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bounded job sizes | |||
Property / zbMATH Keywords: bounded job sizes / rank | |||
Normal rank |
Revision as of 05:37, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semi-online scheduling with bounded job sizes on two uniform machines |
scientific article |
Statements
Semi-online scheduling with bounded job sizes on two uniform machines (English)
0 references
4 November 2016
0 references
scheduling
0 references
uniform machines
0 references
semi-online
0 references
bounded job sizes
0 references