Single machine scheduling problem with controllable processing time and setup under convex resource consumption costs (Q2823723)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6634472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine scheduling problem with controllable processing time and setup under convex resource consumption costs |
scientific article; zbMATH DE number 6634472 |
Statements
6 October 2016
0 references
resource allocation
0 references
workload
0 references
deteriorating jobs
0 references
setup time
0 references
single machine
0 references
Single machine scheduling problem with controllable processing time and setup under convex resource consumption costs (English)
0 references
0.8927230834960938
0 references
0.8680222630500793
0 references
0.865637481212616
0 references
0.8650215864181519
0 references
