Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Capacitated two-parallel machines scheduling to minimize sum of job completion times |
scientific article |
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
