MODELS ARISING FROM A FLEXIBLE MANUFACTURING MACHINE .2. MINIMIZATION OF THE NUMBER OF SWITCHING INSTANTS

被引：86

作者：

TANG, CS ^{[1
]}

DENARDO, EV ^{[1
]}

机构：

[1] YALE UNIV,SCH ORG & MANAGEMENT,NEW HAVEN,CT 06520

来源：

OPERATIONS RESEARCH | 1988年 / 36卷 / 05期

关键词：

Industrial Plants--Flexible Manufacturing Systems - Job Analysis - Machine Tools--Scheduling;

D O I：

10.1287/opre.36.5.778

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider the same manufacturing environment described in a companion study (Part I), but we use a different performance criterion: to minimize the total number of instants at which tools are switched. This performance criterion is appropriate when the switching time is roughly constant and independent of the number of tool switches. We show that this scheduling problem generalizes the classical bin packing problem, and we present a non-LP-based branch-and-bound procedure that terminates with an optimal solution. We extend this procedure to the case of K machines in sequence.

引用

页码：778 / 784

页数：7

共 8 条

[1] STRONG NP-COMPLETENESS RESULTS - MOTIVATION, EXAMPLES, AND IMPLICATIONS [J].