Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (Q4671351): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207540410001721754 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2112862921 / rank | |||
Normal rank | |||
Revision as of 01:41, 20 March 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
