Minimizing total completion time for UET tasks with release time and outtree precedence constraints

Yumei Huo, Joseph Y.T. Leung

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

Brucker et al. (Math Methods Oper Res 56: 407-412, 2003) have given an O(n 2)-time algorithm for the problems P | pj = 1, r j , outtree |∑ Cj and P | pmtn, pj = 1, rj, outtree | ∑ Cj . In this note, we show that their algorithm admits an O(n log n)-time implementation.

Original languageEnglish (US)
Pages (from-to)275-279
Number of pages5
JournalMathematical Methods of Operations Research
Volume62
Issue number2
DOIs
StatePublished - Nov 1 2005

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Management Science and Operations Research

Keywords

  • Nonpreemptive scheduling
  • Outtree
  • Parallel and identical machines
  • Preemptive scheduling
  • Scheduling
  • Total completion time

Fingerprint Dive into the research topics of 'Minimizing total completion time for UET tasks with release time and outtree precedence constraints'. Together they form a unique fingerprint.

Cite this