The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174): 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: 6654089 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
single machine | |||
| Property / zbMATH Keywords: single machine / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
uncertainty | |||
| Property / zbMATH Keywords: uncertainty / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
robust optimization | |||
| Property / zbMATH Keywords: robust optimization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
branch-and-bound | |||
| Property / zbMATH Keywords: branch-and-bound / rank | |||
Normal rank | |||
Revision as of 06:26, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective |
scientific article |
Statements
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (English)
0 references
17 November 2016
0 references
scheduling
0 references
single machine
0 references
uncertainty
0 references
robust optimization
0 references
branch-and-bound
0 references
