An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552)
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: An O( n^2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness |
scientific article; zbMATH DE number 5153369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness |
scientific article; zbMATH DE number 5153369 |
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
0.93578124
0 references
0.9205838
0 references
0 references
0.9165352
0 references
0.91324246
0 references
0.9108563
0 references
0.90711987
0 references
0.9025436
0 references
0.90138113
0 references
