Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints (Q631768): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:19, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints |
scientific article |
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
