A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324)
From MaRDI portal
!
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 7637119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time |
scientific article; zbMATH DE number 7637119 |
Statements
A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (English)
0 references
23 December 2022
0 references
scheduling
0 references
two-stage flow-shop
0 references
parallel batch
0 references
limited waiting time
0 references
incompatible job families
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8330633640289307
0 references
0.8035665154457092
0 references
0.795547604560852
0 references
0.7949022650718689
0 references
0.7920553088188171
0 references
