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

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 p...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production economics Vol. 98; no. 2; pp. 238 - 250
Main Authors Chung, Daeyoung, Lee, Kichang, Shin, Kitae, Park, Jinwoo
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 18.11.2005
Elsevier
Elsevier Sequoia S.A
SeriesInternational Journal of Production Economics
Subjects
Algorithms
Bottleneck machine
Capacity constraint
Due date
Job shop scheduling
Job shops
Manufacturing
Scheduling
Studies
Subcontract
Subcontracts
Job shop scheduling
Capacity constraint
Subcontract
Due date
Bottleneck machine
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0925-5273
1873-7579
DOI:10.1016/j.ijpe.2004.05.023