Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents (Q6621844)
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 7929160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents |
scientific article; zbMATH DE number 7929160 |
Statements
Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents (English)
0 references
21 October 2024
0 references
scheduling with two agents
0 references
no-wait flow shop
0 references
optimal algorithm
0 references
approximation algorithm
0 references
makespan
0 references
0 references
0 references
0.932736873626709
0 references
0.8506879806518555
0 references
0.849586546421051
0 references
0.8349629640579224
0 references
0.8339602947235107
0 references
