Minimizing tardiness in a two-machine flow-shop (Q5959377): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(00)00090-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2113526966 / rank | |||
Normal rank | |||
Latest revision as of 11:11, 30 July 2024
scientific article; zbMATH DE number 1723856
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing tardiness in a two-machine flow-shop |
scientific article; zbMATH DE number 1723856 |
Statements
Minimizing tardiness in a two-machine flow-shop (English)
0 references
3 April 2002
0 references
two-machine flow-shop scheduling
0 references
total tardiness
0 references
branch-and-bound algorithm
0 references
0 references
0 references
