Single machine scheduling with two competing agents and equal job processing times (Q319290): 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 / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C29 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6633489 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
single machine scheduling | |||
| Property / zbMATH Keywords: single machine scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
two competing agents | |||
| Property / zbMATH Keywords: two competing agents / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
equal processing times | |||
| Property / zbMATH Keywords: equal processing times / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
complexity | |||
| Property / zbMATH Keywords: complexity / rank | |||
Normal rank | |||
Revision as of 02:38, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine scheduling with two competing agents and equal job processing times |
scientific article |
Statements
Single machine scheduling with two competing agents and equal job processing times (English)
0 references
6 October 2016
0 references
single machine scheduling
0 references
two competing agents
0 references
equal processing times
0 references
complexity
0 references
