Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints (Q631768): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2010.12.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2010.12.007 / rank | |||
Normal rank | |||
Latest revision as of 05:37, 9 December 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
0 references
