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 条

[11]

Bansal, Minimizing the sum of completion times of n-jobs over m-machines in a flowshop, A I I E Transactions, 9, pp. 306-311, (1977)

[12]

Szwarc, The flow-shop problem with mean completion time criterion, IIE Trans., 15, pp. 172-176, (1983)

[13]

Gupta, Heuristic algorithms for multi-stage flowshop scheduling problem, A I I E Transactions, 4, pp. 11-18, (1972)

[14]

Miyazaki, Nishiyama, Hashimoto, An adjacent pairwise approach to the mean flowtime scheduling problem, J. Oper. Res. Society Japan, 21, pp. 287-299, (1978)

[15]

Ho, Chang, A new heuristic for the n-job, m-machine flow-shop problem, Eur. J. Oper. Res., 52, pp. 194-202, (1991)

[16]

Baker, Introduction to sequencing and scheduling, (1974)

[17]

French, Sequencing and scheduling: An introduction to the mathematics of the job-shop, (1982)

[18]

Garey, Johnson, Sethi, The complexity of flowshop and Jobshop scheduling, Math. Oper. Res., 1, pp. 117-129, (1976)

[19]

Smith, Dudek, A general algorithm for the solution of the n-job m-machine sequencing problem of the flowshop, Operations Research, 15, pp. 71-82, (1967)

[20]

Karg, Thompson, A heuristic approach to solving travelling salesman problems, Management Science, 10, pp. 225-248, (1964)

← 1 2 →