Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison (Q3332755)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison |
scientific article |
Statements
Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison (English)
0 references
1984
0 references
optimal algorithms
0 references
computational comparison
0 references
block processing restriction
0 references
optimal schedule
0 references
total elapsed time
0 references
2\(\times n\) sequencing
0 references
transportation times
0 references
computational complexity
0 references
