Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482)
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: Capacitated two-parallel machines scheduling to minimize sum of job completion times |
scientific article; zbMATH DE number 166476
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Capacitated two-parallel machines scheduling to minimize sum of job completion times |
scientific article; zbMATH DE number 166476 |
Statements
Capacitated two-parallel machines scheduling to minimize sum of job completion times (English)
0 references
16 May 1993
0 references
\(n\)-job two-parallel machines scheduling
0 references
NP-complete
0 references
pseudo-polynomial dynamic programming algorithm
0 references
heuristic
0 references
worst case error bound
0 references
0 references
0 references
0.8938733339309692
0 references
0.872555136680603
0 references
0.836632251739502
0 references
0.8315359950065613
0 references
0.8188804984092712
0 references
