Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs (Q3160580)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs |
scientific article |
Statements
Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs (English)
0 references
14 October 2010
0 references
scheduling
0 references
single-machine
0 references
step-deteriorating jobs
0 references
total completion time
0 references
0.8996675
0 references
0.8843864
0 references
0.8782938
0 references
0.87728065
0 references
0.8765128
0 references
0.86835945
0 references
0.8645276
0 references
0.86436504
0 references
