HEURISTIC ALGORITHM FOR SCHEDULING IN A FLOWSHOP TO MINIMIZE TOTAL FLOWTIME

被引：136

作者：

RAJENDRAN, C

机构：

[1] Division of Industrial Engineering and Management, Department of Humanities and Social Sciences, Indian Institute of Technology, Madras

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 1993年 / 29卷 / 01期

关键词：

D O I：

10.1016/0925-5273(93)90024-F

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In this article, a heuristic algorithm is presented for scheduling in a flowshop to minimize the total flowtime of jobs. A heuristic preference relation is developed and used as the basis for job insertion to build up the complete schedule. When evaluated over a large number of problems of various sizes, the proposed heuristic is found to be very effective in yielding optimal or near-optimal solutions, and emerges superior to the existing heuristics.

引用

页码：65 / 73

页数：9

共 20 条

[1]

Ignall, Schrage, Application of the branch and bound technique to some flowshop scheduling problems, Operations Research, 13, pp. 400-412, (1965)

[2]

Lominicki, A branch-and-bound algorithm for the exact solution of the three machine scheduling problem, Journal of the Operational Research Society, 16, pp. 89-100, (1965)

[3]

Campbell, Dudek, Smith, A heuristic algorithm for the n-job m-machine sequencing problem, Management Science, 16, pp. 630-637, (1970)

[4]

Dannenbring, An evaluation of flowshop sequencing heuristics, Manage. Sci., 23, pp. 1174-1182, (1977)

[5]

King, Spachis, Heuristics for flowshop scheduling, Int. J. Prod. Res., 18, pp. 343-357, (1980)

[6]

Stinson, Smith, A heuristic programming procedure for sequencing the static flowshop, International Journal of Production Research, 20, pp. 753-764, (1982)

[7]

Nawaz, Enscore, Ham, A heuristic algorithm for the m-machine, n-job flowshop sequencing problem, OMEGA, 11, pp. 91-95, (1983)

[8]

Hundal, Rajgopal, An extension of Palmer's heuristic for the flowshop scheduling problem, Int. J. Prod. Res., 26, pp. 1119-1124, (1988)

[9]

Ogbu, Smith, The application of the simulated annealing algorithm to the solution of the n/m/C<sub>max</sub> flowshop problem, Comp. Oper. Res., 17, pp. 243-253, (1990)

[10]

Osman, Potts, Simulated Annealing for permutation flow-shop scheduling, OMEGA, 17, pp. 551-557, (1989)

← 1 2 →