Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133): 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: 90C59 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6650711 / 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 | |||
mean completion time | |||
| Property / zbMATH Keywords: mean completion time / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
uncertainty | |||
| Property / zbMATH Keywords: uncertainty / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
heuristics | |||
| Property / zbMATH Keywords: heuristics / rank | |||
Normal rank | |||
Revision as of 05:22, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine scheduling problem with interval processing times to minimize mean weighted completion time |
scientific article |
Statements
Single machine scheduling problem with interval processing times to minimize mean weighted completion time (English)
0 references
10 November 2016
0 references
scheduling
0 references
single machine
0 references
mean completion time
0 references
uncertainty
0 references
heuristics
0 references
