Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176)
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: Minimizing the makespan in nonpreemptive parallel machine scheduling problem |
scientific article; zbMATH DE number 5994025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the makespan in nonpreemptive parallel machine scheduling problem |
scientific article; zbMATH DE number 5994025 |
Statements
Minimizing the makespan in nonpreemptive parallel machine scheduling problem (English)
0 references
2 January 2012
0 references
optimization
0 references
scheduling
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.9347732
0 references
0.9275336
0 references
0.9273904
0 references
0.9235953
0 references
0.9174942
0 references
0.91644967
0 references
0.9154762
0 references
0.9150339
0 references
