A two-machine no-wait flow shop problem with two competing agents (Q2075466)
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 7473268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-machine no-wait flow shop problem with two competing agents |
scientific article; zbMATH DE number 7473268 |
Statements
A two-machine no-wait flow shop problem with two competing agents (English)
0 references
14 February 2022
0 references
multi-agent
0 references
no-wait in process
0 references
complexity
0 references
flowshop scheduling
0 references
makespan
0 references
0 references
0 references
0.8651710748672485
0 references
0.8575462102890015
0 references
0.8473358750343323
0 references
0.836037814617157
0 references
0.8333327770233154
0 references
