author Hanil Jeong 
2nd author / Kidong Kim (Dept. of Industrial Engineering, Seoul National University)
/ Chankwon Park (Dept. of Industrial Engineering, Seoul National University)
/ Jinwoo Park (Dept. of Industrial Engineering, Seoul National University)
/ Seongyoung Jang (Dept. of Industrial Engineering, Seoul National University) 
presenter  
info Date: 1996년 10월 29일 ~ 1996년 10월 31일
City: Seoul
Nation: Korea
Additional Information: Vol. I, 337-342 
year 1996 
category IC 
start / end date  
city / nation  
학회 PCM 
keywords Batch Splitting, Branch and Bound, Job Shop Schuduling 
abstract The job shop scheduling problem has been a major target for many researchers. Unfortunately, though, most of the past studies assumed that a job consists of only a single part. However, if we assume that a job consists of a batch as in many real manufacturing environment, and allow each part to be processed independently, then we can obtain an improved schedule because we can fill up the idle times of machines with jobs of smaller processing times. However, then, the size of the scheduling problem would become too large to be solved in practical time limit, and the clerical work will also increase to handle the increased number of production orders. 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(material requirement planning) system for a planning period exceeds the capacity of production system. We try to get an improved schedule by splitting the original batch into smaller batches, and thereby meet the due date requirement without resorting to rescheduling of the master production schedule. For the given batch, we disaggregate the job processing time into smaller chunks according to the algorithm we are proposing. And then, a new branch and bound algorithm is applied to solve the transformed job shop scheduling problem. It also turned out that we can adapt to unexpected dynamic events more elegantly by allowing batch splitting. Experimental results are included to show the computational characteristics of the proposed approach and the efficiency of the proposed algorithm. 

Download:

번호 category 학회 제목 author presenter year
75 IC  AsiaSim  Vendor Managed Inventory and its value in the various supply chain Sungwon Jung    2004 
74 IC  AsiaSim  Performance Analysis of Alternative Designs for a Vehicle Disassembly System using Simulation Modeling file Eoksu Sim    2004 
73 IC  AsiaSim  Reorder decision system based on the concept of the order risk using neural networks Sungwon Jung    2004 
72 IC  AsiaSim  The Cost Valuation Model for Reverse Supply Chain Using System Dynamics Hyunjong Jeong    2006 
71 IC  AsiaSim  A Model and Analysis of the Bullwhip Effect Using a SCOR-based Framework Haejoong Kim    2007 
70 IC  AsiaSim  An Economic Analysis on RFID Impact in Supply Chain Kiheon Nam    2008 
69 IC  AsiaSim  A Study on the Effects of Highlighted Display on Knowledge Worker Productivity Jinwu Seo    2009 
68 IC  AsiaSim  Developing a Practical Machine Scheduler for Worker-Involved Reconfigurable Manufacturing Systems Jinwu Seo    2011 
67 IC  AsiaSim  A Study on Simulation Model for Yard Layout Planning in Offshore Plant Industry file Kim Hyun Jun  Kim Hyun Jun  2015 
66 IC  CIE  A batch splitting heuristic for dynamic job shop scheduling problem Hanil Jeong    1996 
65 IC  CIE  A decision support model for the initial design of FMS Hosub Shin    1996 
64 IC  CIE  Decision support system for preliminary cost estimation with case based reasoning file Jonghan Kim    2004 
63 IC  CIE  Information Strategy Planning for the Korean Postal Address Database file Tai-Woo Chang    2004 
62 IC  e-Biz  Design of Information System for e-Logistics Kitae Shin    2004 
61 IC  EURO  Multiperiod Hybrid Manufacturing/Remanufacturing Planning Under the Internet-of-Things Scenario file Young-woo Kim  Young-woo Kim  2015 
60 IC  FAIM 2016  A Study on the Distributed Vehicle Routing Problem of emergency vehicle fleet in the Disaster Scene file Sumin Han  Sumin Han  2016 
59 IC  GameNets  Paris Metro Pricing for Internet Service Differentiation Dongmyung Lee    2011 
58 IC  GECCO  A Study on the Resource Allocation Planning for Automated Container Terminals Yangja Jang    2001 
57 IC  GECCO  A Generic Network Design for a Closed-loop Supply Chain Using Genetic Algorithm file Eoksu Sim    2004 
56 IC  GECCO  Solving Multi-level Lot Sizing Problem with Memetic Algorithm based on Refinement Procedure file Haejoong Kim    2006