Minimizing total completion time for UET tasks with release time and outtree precedence constraints期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

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

Authors:	Yumei Huo Joseph Y -T Leung

Institution:	(1) Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA

Abstract:	Brucker et al. (Math Methods Oper Res 56: 407–412, 2003) have given an O(n ²)-time algorithm for the problems $P \mid p_{j} = 1, r_{j}$ , outtree $\mid \sum C_{j}$ and $P \mid pmtn, p_{j} = 1, r_{j}$ , outtree $\mid \sum C_{j}$ . In this note, we show that their algorithm admits an O(n log n)-time implementation.

Keywords:	Scheduling Parallel and identical machines Total completion time Outtree Preemptive scheduling Nonpreemptive scheduling
本文献已被 SpringerLink 等数据库收录！