quotation:		[Copy]
		Yumei LI,Hongxing LI,Vincent C. YEN.[en_title][J].Control Theory and Technology,2007,5(4):345~350.[Copy]

This Paper:Browse 710 Download 20	码上扫一扫！

YumeiLI,HongxingLI,VincentC.YEN
0 Fontlarge +\|Default\|Small
()

摘要:

关键词:

DOI：

Received:March 16, 2006Revised:March 29, 2007

基金项目:

A new polynomial algorithm for a parallel identical scheduling problem

Yumei LI, Hongxing LI, Vincent C. YEN

(School of Information Engineering, Beijing Technology and Business University, Beijing 100037, China; School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China; Department of Management Science and Information Systems, Wright State University, Dayton, Ohio 45435-0001, USA)

Abstract:

A precedence order is defined based on the release dates of jobs' direct successors. Using the defined precedence order and Heap Sort, a new polynomial algorithm is provided which aims to solve the parallel scheduling problem P|p = 1, r ,outtree|∑C . The new algorithm is shown to be more compact and easier to implement.

Key words: Scheduling problem Precedence order Heap sort Algorithm