The scheduling problem where multiple machines compete for a common local buffer (Q1127173)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The scheduling problem where multiple machines compete for a common local buffer |
scientific article; zbMATH DE number 1189550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The scheduling problem where multiple machines compete for a common local buffer |
scientific article; zbMATH DE number 1189550 |
Statements
The scheduling problem where multiple machines compete for a common local buffer (English)
0 references
13 August 1998
0 references
scheduling jobshops
0 references
restricted buffer space
0 references
two-stage flowshop
0 references
multiple machines
0 references
sum of weighted completion times
0 references
0.8097085356712341
0 references
0.8083042502403259
0 references
0.8048747181892395
0 references
0.8037185668945312
0 references
