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

Brucker et al. (Math Methods Oper Res 56: 407–412, 2003) have given an O(n 2 )-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. Copyright Springer-Verlag 2005

MoreLess

Year of publication:	2005
Authors:	Huo, Yumei ; Leung, Joseph
Published in:	Computational Statistics. - Springer. - Vol. 62.2005, 2, p. 275-279
Publisher:	Springer
Subject:	Scheduling \| Parallel and identical machines \| Total completion time \| Outtree \| Preemptive scheduling \| Nonpreemptive scheduling

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010759597