Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints (Q631768)
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 5865592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints |
scientific article; zbMATH DE number 5865592 |
Statements
Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints (English)
0 references
14 March 2011
0 references
bicriteria scheduling
0 references
machine availability constraint
0 references
makespan
0 references
total completion time
0 references
polynomial time algorithms
0 references
two machine
0 references
0 references
0.8996948003768921
0 references
0.8730581998825073
0 references
0.8469724059104919
0 references
0.846602737903595
0 references
0.8286258578300476
0 references
