Scheduling with tool changes to minimize total completion time: Basic results and SPT performance

被引：37

作者：

Akturk, MS ^{[1
]}

Ghosh, JB

Gunes, ED

机构：

[1] Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey

[2] Univ So Calif, Dept Informat & Operat Management, Los Angeles, CA USA

[3] INSEAD, Prod & Operat Management, Fontainebleau, France

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2004年 / 157卷 / 03期

关键词：

scheduling; tool change; SPT list-scheduling; performance analysis;

D O I：

10.1016/S0377-2217(03)00232-7

中图分类号：

C93 [管理学];

学科分类号：

12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

We consider a single machine sequencing problem subject to tool wear, where the objective is to minimize the total completion time. We briefly describe the problem and discuss its properties, complexity and solution. Mainly, however, we focus on the performance of the SPT list-scheduling heuristic. We provide theoretical worst-case bounds on SPT performance and also demonstrate its empirical behavior. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：784 / 790

页数：7

共 18 条

[1]

SINGLE-MACHINE FLOW-TIME SCHEDULING WITH A SINGLE BREAKDOWN [J].