The distributed no-idle permutation flowshop scheduling problem with due windows (Q6546486)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7855888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The distributed no-idle permutation flowshop scheduling problem with due windows |
scientific article; zbMATH DE number 7855888 |
Statements
The distributed no-idle permutation flowshop scheduling problem with due windows (English)
0 references
29 May 2024
0 references
distributed permutation flowshop scheduling
0 references
no-idle constraints
0 references
due windows
0 references
total weighted earliness and tardiness
0 references
iterated greedy algorithm
0 references
0 references
0 references
0.7821663618087769
0 references
0.7560253143310547
0 references
0.7463015913963318
0 references
