On the NP-completeness of the n/m/parallel/\(\sum_{i\leq i\leq m}\{\sum w_ j\sum t_ j\}\) scheduling problem (Q917428)
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: On the NP-completeness of the n/m/parallel/\(\sum_{i\leq i\leq m}\{\sum w_ j\sum t_ j\}\) scheduling problem |
scientific article; zbMATH DE number 4156180
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the NP-completeness of the n/m/parallel/\(\sum_{i\leq i\leq m}\{\sum w_ j\sum t_ j\}\) scheduling problem |
scientific article; zbMATH DE number 4156180 |
Statements
On the NP-completeness of the n/m/parallel/\(\sum_{i\leq i\leq m}\{\sum w_ j\sum t_ j\}\) scheduling problem (English)
0 references
1989
0 references
NP-completeness
0 references
simultaneously available jobs
0 references
parallel machines
0 references
weighted sum of machine makespans
0 references
