An O(n2.logn) algorithm for a nonpreemptive schedule on one machine

Trịnh Nhật Tiến
Author affiliations

Authors

  • Trịnh Nhật Tiến Publishing House for Science and Technology

DOI:

https://doi.org/10.15625/1813-9663/15/1/7755

Abstract

An O(n2) algorithm for problem 1| rj | ∑Uj in the case that release dates and due dates are similarly ordered (i.e., rj < rk => dj ≤ dk) is provided by authors H. Kise, T. Ibaraki and H. Mine in [4]. In this paper, we would describe an O(n2.logn) algorithm to determine a schedule of the same problem but furthermore in minimal processing time.

Metrics

Metrics Loading ...

Published

18-02-2016

How to Cite

[1]
T. N. Tiến, “An O(n2.logn) algorithm for a nonpreemptive schedule on one machine”, JCC, vol. 15, no. 1, pp. 66–76, Feb. 2016.

Issue

Section

Computer Science