Minimizing the sum of job completion times on capacitated two-parallel machines (Q1014943)
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 5549986
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the sum of job completion times on capacitated two-parallel machines |
scientific article; zbMATH DE number 5549986 |
Statements
Minimizing the sum of job completion times on capacitated two-parallel machines (English)
0 references
30 April 2009
0 references
parallel machine scheduling
0 references
availability constraints
0 references
branch and bound algorithm
0 references
0.872555136680603
0 references
0.8643708229064941
0 references
0.8344711661338806
0 references
0.8306004405021667
0 references
0.8149403929710388
0 references
