SCHEDULING A FLOW-LINE MANUFACTURING CELL - A TABU SEARCH APPROACH

被引：42

作者：

SKORINKAPOV, J ^{[1
]}

VAKHARIA, AJ ^{[1
]}

机构：

[1] UNIV ARIZONA,KARL ELLER GRAD SCH MANAGEMENT,DEPT MANAGEMENT INFORMAT SYST,TUCSON,AZ 85721

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1993年 / 31卷 / 07期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1080/00207549308956819

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The performance of two heuristic procedures for the scheduling of a flow-line manufacturing cell was compared. We propose a procedure based on a combinatorial search technique known as tabu search. The new procedure is compared with a heuristic based on simulated annealing which was proposed in earlier research. The scheduling problem addressed here differs from the traditional flow-shop scheduling problem in the sense that we are interested in sequencing part families (i.e. groups of jobs which share a similar setup) as well as individual jobs within each family. The results reveal that the tabu search heuristic outperforms the simulated annealing heuristic by generating 'better solutions' in less computation time.

引用

页码：1721 / 1734

页数：14

共 19 条

[1] Askin R.G., Vakharia A.J., Group technology-s-cell formation and operation, The Automated Factory Handbook: Technology and Management, pp. 317-366, (1990)
[2] Baker K.R., Introduction to Sequencing and Scheduling, (1974)
[3] Burbidge J.L., The Introduction Ofgroup Technology, (1975)
[4] Burbidge J.L., Group Technology in the Engineering Industry, (1979)
[5] Eck B.T., Good Solutions to Job Shop Scheduling Problems via Tabu Search, (1989)
[6] Glover F., Tabu search-Part I, ORSA Journal of Computing, 1, 3, pp. 190-206, (1989)
[7] Glover F., Tabu Search-Part II, ORSA Journal of Computing, 2, 1, pp. 4-32, (1990)
[8] Glover F., Hubscher R., Bin Packing and Tabu Search, (1991)
[9] Glover F., Laguna M., Target Analysis to Improve Tabu Search for Machine Scheduling, (1989)
[10] Glover F., Laguna M., Bandwidth Packing: A Tabu Search Approach, (1991)

← 1 2 →