Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs (Q3160580): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/jors.2008.123 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1976916754 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:04, 20 March 2024
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
