An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:28, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness |
scientific article |
Statements
An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (English)
0 references
15 May 2007
0 references
Single machine
0 references
Preemptive scheduling
0 references
Release date
0 references
Equal-length jobs
0 references
Total tardiness
0 references
