Minimizing total completion time subject to release dates and sequence-dependent processing times (Q1290157)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total completion time subject to release dates and sequence-dependent processing times |
scientific article |
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
