Heuristics for minimizing tool switches when scheduling part types on a flexible machine

被引：52

作者：

Hertz, A ^{[1
]}

Laporte, G

Mittaz, M

Stecke, KE

机构：

[1] Ecole Polytech Fed Lausanne, Dept Math, CH-1015 Lausanne, Switzerland

[2] Ecole Hautes Etud Commerciales, Gerad, Montreal, PQ H3T 2A7, Canada

[3] Univ Michigan, Sch Business Adm, Ann Arbor, MI 48109 USA

来源：

IIE TRANSACTIONS | 1998年 / 30卷 / 08期

关键词：

D O I：

10.1023/A:1026434104330

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This article considers a tool loading problem whose objective is to minimize the number of tool switches over time in order to process several parts on a flexible machine. New heuristics are presented and compared. Some of these are shown to be superior to existing methods.

引用

页码：689 / 694

页数：6

共 15 条

[1]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[2] Tool magazine arrangement and operations sequencing on CNC machines [J].

Avci, S ;

Akturk, MS .

COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (11) :1069-1081

[3] A HEURISTIC FOR MINIMIZING THE NUMBER OF TOOL SWITCHES ON A FLEXIBLE MACHINE [J].

BARD, JF .

IIE TRANSACTIONS, 1988, 20 (04) :382-391

[4]

Crama Y., 1994, International Journal of Flexible Manufacturing Systems, V6, P33, DOI 10.1007/BF01324874

[5]

Follonier J.-. P., 1994, BELGIAN J OPERATIONS, V34, P55

[6] NEW INSERTION AND POSTOPTIMIZATION PROCEDURES FOR THE TRAVELING SALESMAN PROBLEM [J].

GENDREAU, M ;

HERTZ, A ;

LAPORTE, G .

OPERATIONS RESEARCH, 1992, 40 (06) :1086-1094

[7]

Golden BL, 1985, TRAVELING SALESMAN P, P207

[8] A SYNTHESIS OF DECISION-MODELS FOR TOOL MANAGEMENT IN AUTOMATED MANUFACTURING [J].

GRAY, AE ;

SEIDMANN, A ;

STECKE, KE .

MANAGEMENT SCIENCE, 1993, 39 (05) :549-567

[9] Improved tabu search approach for solving the job shop scheduling problem with tooling constraints [J].

Hertz, A ;

Widmer, M .

DISCRETE APPLIED MATHEMATICS, 1996, 65 (1-3) :319-345

[10]

KIRAN AS, 1988, IND ENG, V20, P52

← 1 2 →