author Hanil Jeong 
2nd author /Jinwoo Park (Dept. of Industrial Engineering, Seoul National University)
/ Robert C. Leachman (Dept. of IEOR, University of California at Berkeley) 
info International Journal of Production Research (SCI, 0.774), Vol. 37, No. 15, pp.3583-3589, 1999 
year 1999 
c IJ 
저널/학회 IJPR 
group SCI 
keyword Batch Splitting, Job Shop, Scheduling, MRP 
abstract The job shop scheduling problem has been a major target for many researchers. Unfortunately though, most of the previous researches were based on assumptions that are different from the real manufacturing environment. Among those distorted assumptions, two assumptions about setup time and job composition can highly influence the performance of schedule. Firstly, most of the past studies ignored the impact of the before-arrival setup time. If we know the sequence of operations in advance, we can obtain an improved schedule by preparing the setup before job arrives. Secondly, most of the past studies assumed that a job consists of only a single part, that is a batch of size one. However, if we assume that a job consists of a batch size greater than one as in many real manufacturing environment, then we can obtain an improved schedule because we can fill up the idle times of machines with jobs which have smaller processing times by splitting the original batches. However, then, the number of job orders may increase due to the split and the size of the scheduling problem would become too large to be solved in practical time limit. And so, there may be an optimum batch size considering trade-off between better solution and tractability. Current study is the result of an attempt to find an acceptable solution when the production requirement from MRP system for a planning period exceeds the capacity of a production system. We try to get an improved schedule by splitting the original batch into smaller batches considering setting up a machine before the actual arrival of jobs to the machine and thereby meet the due date requirement without resorting to rescheduling of the master production schedule. For the given batch, we disaggregate it according to the algorithm we are proposing. And then, a so-called "modified shifting bottleneck procedure" is applied to solve the job shop scheduling problem with before-arrival family setup time considering release date, transportation time and due date. The study also shows that we can adapt to unexpected dynamic events more elegantly by allowing the splitting of batches. 
번호 c 저널/학회 group 제목 author year
19 IJ  LNCS  SCIE  A Generic Network Design for a Closed-loop Supply Chain Using Genetic Algorithm file Eoksu Sim  2004 
18 IJ  LNAI  SCOPUS  Performance Analysis of Alternative Designs for a Vehicle Disassembly System using Simulation Modeling file Eoksu Sim  2005 
17 DJ  IE Interfaces    영상처리를 이용한 반복적 작업의 측정에 관한 연구 file Eoksu Sim  2001 
16 IJ  IJAMT  SCIE  Efficient work measurement system of manufacturing cells using speech recognition and digital image processing technology file Eoksu Sim  2006 
15 DJ  IE Interfaces    공급 사슬 상의 분산 제조 시스템의 통합 생산 계획에 관한 연구 file Dosung Go  2000 
14 IJ  IMDS  SCIE  RFID-based traceability in the supply chain file Dongmyung Lee  2008 
13 IJ  INTECH    RFID-enabled Supply Chain Traceability: Existing Methods, Applications and Challenges file Dongmyung Lee  2010 
12 IJ  LNCS  SCOPUS  A Token Pricing Scheme for Internet Services file Dongmyung Lee  2011 
11 IJ  LNICST    Paris Metro Pricing for Internet Service Differentiation file Dongmyung Lee  2011 
10 IJ  IEEE JSAC  SCI  Price of Simplicity under Congestion file Dongmyung Lee  2012 
9 DJ  EJIT    개방형 비즈니스 환경에서의 통합된 공급사슬계획에 대한 연구 file Dongmyung Lee  2010 
8 DJ  IE Interfaces    분산객체와 XML 기반의 생산계획 컴포넌트 개발에 관한 연구 file Daiki Min  2002 
7 IJ  C&IE  SCIE  Developing a Shop Floor Scheduling and Control Software for an FMS file Daeyoung Chung  1996 
6 IJ  IJPE  SCIE  A new approach to job shop scheduling problems with due date constraints considering operation subcontracts file Daeyoung Chung  2005 
5 DJ  CALSE/EC    기능모형으로부터 프로세스흐름 모형으로의 변환을 통한 시스템의 개념적 설계에 대한 연구 file Chankwon Park  1996 
4 DJ  시뮬레이션    CIM환경에서 프로세스 설계를 위한 시뮬레이션 코드의 자동생성에 관한 연구 Chankwon Park  1997 
3 DJ  시뮬레이션    생산 계획 및 우선순위 규칙에 따른 Order Release 정책의 유효성에 관한 연구 Byeongdae Choi  1999 
2 DJ  산업경영시스템    DEA와 BSC 기법을 이용한 조직 효율성 비교에 대한 연구 file Bumsoo Kim  2005 
1 IJ  IMDS  SCIE  A supply chain performance measurement approach using the internet of things: Toward more practical SCPMS file Abdallah Jamal Dweekat  2017