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


번호 category 학회 제목 author presenter year
75 IC  ICMA  Machine-Understandable e-Business Modeling with Ontology Tai-Woo Chang    2002 
74 IC  Asian eBiz  A Systematic Approach for Ontology-based e-Business Modeling Tai-Woo Chang    2002 
73 IC  SCSC  Performance Improvement Methodology for a Manufacturing System using Petri Nets and Simulation Analysis Kichang Lee    2002 
72 IC  SCSC  Inventory Management in a Supply Chain using Neural Networks file Sungwon Jung    2002 
71 IC  IBERC  An Ontology-Based Framework for e-Business Integration file Tai-Woo Chang    2003 
70 IC  ICPR  Combined production and distribution planning using demand based mixed Genetic Algorithm in a supply chain file Sungwon Jung    2003 
69 IC  CIE  Decision support system for preliminary cost estimation with case based reasoning file Jonghan Kim    2004 
68 IC  SCSC  Performance Evaluation of Alternative Designs for the Car Recycling System Using Simulation Analysis file Eoksu Sim    2004 
67 IC  GECCO  A Generic Network Design for a Closed-loop Supply Chain Using Genetic Algorithm file Eoksu Sim    2004 
66 IC  AsiaSim  Vendor Managed Inventory and its value in the various supply chain Sungwon Jung    2004 
65 IC  AsiaSim  Performance Analysis of Alternative Designs for a Vehicle Disassembly System using Simulation Modeling file Eoksu Sim    2004 
64 IC  AsiaSim  Reorder decision system based on the concept of the order risk using neural networks Sungwon Jung    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  ICCSA  Efficient Mapping Rule of IDEF for UMM Application file Kitae Shin    2005 
60 IC  KGW  A study on due-date assignment method in wafer fabrication facility producing multiple product types file Jaewon Park    2005 
59 IC  Asian eBiz  Applying Negotiation Patterns in Supply Chain Planning based on Self-integrating Environment file Yuncheol Kang    2005 
58 IC  GECCO  Solving Multi-level Lot Sizing Problem with Memetic Algorithm based on Refinement Procedure file Haejoong Kim    2006 
57 IC  ISFA  A framework for the ubiquitous MES using RFID and Web services technology file Manchul Han    2006 
56 IC  AsiaSim  The Cost Valuation Model for Reverse Supply Chain Using System Dynamics Hyunjong Jeong    2006