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

Author: Tian Zhongjun   Ng C.   Cheng T.  

Publisher: Springer Publishing Company

ISSN: 1094-6136

Source: Journal of Scheduling, Vol.9, Iss.4, 2006-08, pp. : 343-364

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract