Minimizing Total Completion Time on Parallel Machines with Deadline Constraints (Q4429690)
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 1986359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing Total Completion Time on Parallel Machines with Deadline Constraints |
scientific article; zbMATH DE number 1986359 |
Statements
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints (English)
0 references
28 September 2003
0 references
parallel and identical machines
0 references
unrelated machines
0 references
total completion time
0 references
deadline constraints
0 references
preemptive scheduling
0 references
maximum lateness
0 references
polynomial-time algorithm
0 references
0.9268165230751038
0 references
0.8627139925956726
0 references
0.8586494326591492
0 references
0.8495702147483826
0 references
0.8382763862609863
0 references
