Skip to main navigation Skip to search Skip to main content

An O (n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness

Research output: Journal article publication › Journal article › Academic research › peer-review

21   Link opens in a new tab Citations (Scopus)

Fingerprint

Dive into the research topics of 'An O (n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness'. Together they form a unique fingerprint.
Sort by

Keyphrases

Mathematics