CATEGORY

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

2015.07.31 16:39

관리자 조회 수:1003

author Daeyoung Chung 
2nd author / Kichang Lee (Samsung Electronic-Mechanics)
/ Kitae Shin (Dept. of Industrial Engineering, Dae jin University)
/ Jinwoo Park (Dept. of Industrial Engineering, Seoul National University) 
info International Journal of Production Economics (SCIE, 2.026), Vol. 98, No. 2, pp.238-250, 2005 
year 2005 
c IJ 
저널/학회 IJPE 
group SCIE 
keyword job shop scheduling, Due date, Capacity constraint, subcontract, Bottleneck machine 
abstract 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 optionality. 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. 

Download : dychung_2005_IJPE_ANewApproachToJobShopSchedulingProblems.zip

이 게시물을
목록
목록
쓰기
태그
Address

39-317, Dept. of Industrial Engineering,

Seoul National University, Shillim-dong, Gwanak-gu,

Seoul, 151-744 Korea

Contacts

+82-2-880-7182

Designed by MAILAB. All Rights Reserved.