A new approach to job shop scheduling problems with due date constraints considering operation subcontracts

被引：52

作者：

Chung, DY ^{[1
]}

Lee, K ^{[1
]}

Shin, K ^{[1
]}

Park, J ^{[1
]}

机构：

[1] Seoul Natl Univ, Dept Ind Engn, Seoul, South Korea

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2005年 / 98卷 / 02期

关键词：

job shop scheduling; due date; capacity constraint; subcontract; bottleneck machine;

D O I：

10.1016/j.ijpe.2004.05.023

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We consider a kind of job shop scheduling problems with due-date constraints, where temporal relaxation of machine capacity constraint is possible through subcontracts. In practice, this kind of problem is frequently found in manufacturing industries where outsourcing of manufacturing operation is possible through subcontract. We present a heuristic algorithm that addresses the problem by solving a series of smaller subproblems to optimality. For the sake of efficiency, the algorithm repeatedly executes in two steps-(1) improving the sequence of operations and (2) picking out the operations to be subcontracted-on bottleneck machines. Experiments are conducted for example problems, and the result of the experiment confirms the viability of the suggested algorithm. (c) 2005 Elsevier B.V. All rights reserved.

引用

页码：238 / 250

页数：13

共 19 条

[1] THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING [J].