Minimizing total completion time subject to release dates and sequence-dependent processing times (Q1290157)
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: Minimizing total completion time subject to release dates and sequence-dependent processing times |
scientific article; zbMATH DE number 1299356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total completion time subject to release dates and sequence-dependent processing times |
scientific article; zbMATH DE number 1299356 |
Statements
Minimizing total completion time subject to release dates and sequence-dependent processing times (English)
0 references
10 June 1999
0 references
release dates
0 references
sequence-dependent processing times
0 references
single machine
0 references
total completion time
0 references
cumulative traveling salesman problem
0 references
additional time constraints
0 references
dynamic programming
0 references
heuristic algorithms
0 references
sequencing landing aircraft
0 references
0.8381271362304688
0 references
0.7971879243850708
0 references
0.7811706066131592
0 references
0.7770506739616394
0 references
0.7733948826789856
0 references
