Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (Q1924612)
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 total completion time and maximum cost simultaneously is solvable in polynomial time |
scientific article; zbMATH DE number 937078
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time |
scientific article; zbMATH DE number 937078 |
Statements
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (English)
0 references
23 March 1997
0 references
maximum lateness
0 references
bicriteria single-machine schedulinge
0 references
total completion time
0 references
maximum cost
0 references
0 references
