"An O(n2) algorithm for scheduling equal-length preemptive jobs ..."

Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng (2006)

> Home

Details and statistics

DOI: 10.1007/S10951-006-7039-6

access: closed

type: Journal Article

metadata version: 2021-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/TianNC06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/TianNC06
Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng:
An O(n²) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. J. Sched. 9(4): 343-364 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.