Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (Q4671351): Difference between revisions
From MaRDI portal
Latest revision as of 10:31, 10 June 2024
scientific article; zbMATH DE number 2161436
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems |
scientific article; zbMATH DE number 2161436 |
Statements
Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (English)
0 references
26 April 2005
0 references
0 references
