Two-machine flowshop minimum-length scheduling problem with random and bounded processing times (Q4806914): 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.1111/1475-3995.00393 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008958187 / rank | |||
Normal rank | |||
Revision as of 22:50, 19 March 2024
scientific article; zbMATH DE number 1911100
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-machine flowshop minimum-length scheduling problem with random and bounded processing times |
scientific article; zbMATH DE number 1911100 |
Statements
Two-machine flowshop minimum-length scheduling problem with random and bounded processing times (English)
0 references
23 June 2003
0 references
scheduling
0 references
flowshop
0 references
makespan
0 references
dominance relations
0 references
