Minimizing Total Completion Time on Parallel Machines with Deadline Constraints (Q4429690): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539702406388 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966475537 / rank | |||
Normal rank | |||
Latest revision as of 10:18, 30 July 2024
scientific article; zbMATH DE number 1986359
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
