Algorithm to Minimize Total Spanding Time on Parallel machine

Jing Ling; Huang Decai; Yang Wannian

Volume 24 Issue 1

Jan. 1998

Turn off MathJax

Article Contents

Journal of Beijing University of Aeronautics and Astronautics > 1998 > 24(1): 58-59.

Jing Ling, Huang Decai, Yang Wannianet al. Algorithm to Minimize Total Spanding Time on Parallel machine[J]. Journal of Beijing University of Aeronautics and Astronautics, 1998, 24(1): 58-59. (in Chinese)

Citation:

Jing Ling, Huang Decai, Yang Wannianet al. Algorithm to Minimize Total Spanding Time on Parallel machine[J]. Journal of Beijing University of Aeronautics and Astronautics, 1998, 24(1): 58-59. (in Chinese)

Citation:

PDF( 79 KB)

Algorithm to Minimize Total Spanding Time on Parallel machine

1.
Beijing University of Aeronautics and Astronautics,Dept.of Manufacturing Enginnering
2. Chongqing University,Dept. of Applied Mathematics

Received Date: 14 Aug 1996
Publish Date: 31 Jan 1998

Abstract

Abstract

The problem of scheduling of a set of jobs on parallel machines is discussed.An algorithm to minimize the total spanding time (processing time plus waiting time) is described,in which processing time of a job can be different on different machines.The mathematical model of this problem is set up.The scheduling problem can be transformed into assignment problem,and the optimization solution can be obtained by Hungarian algorithm.The time complexity of the presented method is a polynomial bound scheduling algorithm.In the end a numerical example is given to explain the solution process.
- parallel processing,
- sequencing,
- optimization algorithms,
- assignment problem