Competitive project scheduling on two unbounded parallel batch machines (Q1656205)
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 6915975
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Competitive project scheduling on two unbounded parallel batch machines |
scientific article; zbMATH DE number 6915975 |
Statements
Competitive project scheduling on two unbounded parallel batch machines (English)
0 references
10 August 2018
0 references
project scheduling
0 references
competition
0 references
parallel batch machine
0 references
0.8480538129806519
0 references
0.8202009201049805
0 references
0.8011996746063232
0 references
0.785794198513031
0 references
