Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity (Q4380542): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1501009594 / rank | |||
Normal rank | |||
Latest revision as of 02:14, 20 March 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
