Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity (Q4380542): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:23, 7 February 2024
scientific article; zbMATH DE number 1129407
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity |
scientific article; zbMATH DE number 1129407 |
Statements
Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity (English)
0 references
7 September 1998
0 references
flowshop scheduling
0 references
makespan
0 references
