A HEURISTIC FOR SCHEDULING IN FLOWSHOP AND FLOWLINE-BASED MANUFACTURING CELL WITH MULTICRITERIA

被引：61

作者：

RAJENDRAN, C

机构：

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

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1994年 / 32卷 / 11期

关键词：

D O I：

10.1080/00207549408957083

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The problem of scheduling in flowshop and flowline-based manufacturing cell is considered with the bicriteria of minimizing makespan and total flowtime of jobs. The formulation of the scheduling problems for both the flowshop and the flowline-based manufacturing cell is first discussed. We then present the development of the proposed heuristic for flowshop scheduling. A heuristic preference relation is developed as the basis for the heuristic so that only the potential job interchanges are checked for possible improvement with respect to bicriteria. The proposed heuristic algorithm as well as the existing heuristic are evaluated in a large number of randomly generated large-sized flowshop problems. We also investigate the effectiveness of these heuristics with respect to the objective of minimizing total machine idletime. We then modify the proposed heuristic for scheduling in a cell, and evaluate its performance.

引用

页码：2541 / 2558

页数：18

共 21 条

[1]

Burbridge J.L., The Introduction to Group Technology, (1975)

[2]

Campbell H.G., Duoek R.A., Smith M.L., A heuristic algorithm for the n-job, m-machine sequencing problem, Management Science, 16, pp. 630-637, (1970)

[3]

Chandrasekran M.P., Rajagopalan R., ZODIAC-an algorithm for concurrent formation of part familiesand machine cells, International Journal of Production Research, 25, pp. 835-850, (1987)

[4]

Dannenbring D.G., An evaluation of flow-shop sequencing heuristics, Management Science, 23, pp. 1174-1182, (1977)

[5]

Dumolien W.J., Santen W.P., Cellular manufacturing becomes philosophy of management at component facility, Industrial Engineering, 34, pp. 72-76, (1983)

[6]

French S., Sequencing and Scheduling: An Introduction to the Mathematics Ofthe Job-Shop, (1982)

[7]

Garey M.R., Johnson D.S., Sethi R., Complexity of Flowshop and Jobshop Scheduling, 1, pp. 117-129, (1976)

[8]

Ho J.C., Chang Y.-L., A new heuristic for the n-job, m-machine flowshop problem, European Journal of Operational Research, 52, pp. 194-202, (1991)

[9]

Hundal T.S., Rajgopal J., An extension of Palmer's heuristic for the flowshop scheduling problem, International Journal of Production Research, 26, pp. 1119-1124, (1988)

[10]

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

← 1 2 3 →