Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity (Q4380542): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Suresh P. Sethi / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Chelliah Skriskandarajah / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Steef L. van de Velde / rank | |||
Normal rank | |||
Revision as of 05:15, 22 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
