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
» IC  PCM  An Intelligent Batch Splitting method for Schedule Improvement in MRP Environment Hanil Jeong    1996 
74 IC  PCM  FMS Scheduling Strategies in a Distributed Coordination Environment Jonghun Park    1996 
73 IC  ICPR  A Study on FMS Scheduling Problems Based on Priority Functions Generated by Genetic Programming ChangUk Kim    1997 
72 IC  ICPR  A Scheduling Algorithm considering Subcontract cost in MRP Environment Kichang Lee    1997 
71 IC  IFAC on IMS  A Weighted Load Balancing Heuristic that Minimizes Makespan in Alternative Routing and Machine Environment Kidong Kim    1997 
70 IC  APIEMS  An Integrated Approach for Loading and Scheduling of a Flexible Manufactureing System Sangbok Woo    1999 
69 IC  APIEMS  A Study on Developing a Scheduling System in Alternative Routing and Machine Environment Kidong Kim    1999 
68 IC  IW on IMS  Maximally permissive adaptive control of an automated manufacturing cell Sangkyun Kim    1999 
67 IC  ICPR  An Algrorithm for Job Shop Scheduling Problem with Due Date Constraints Considering Operation Subcontract Daeyoung Chung    2000 
66 IC  INFORMS-KORMS  Hybrid Algorithms in Integrated Quality Design & Scheduling Jonghan Kim    2000 
65 IC  INFORMS-KORMS  Development of capacitated event-driven MRP components using object oriented method Seunghyun Yoon    2000 
64 IC  PAIS  Knowledge Acquisition using Neural Network and Simulator Kitae Shin    2001 
63 IC  SeoulSim  Design for a Hybrid System of Integration Kanban with MRPII Taeyoung Song    2001 
62 IC  GECCO  A Study on the Resource Allocation Planning for Automated Container Terminals Yangja Jang    2001 
61 IC  ICPR  Development of a Decision Support System for the formulation of Manufacturing Kichang Lee    2001 
60 IC  ICRA  An On-Line Production Scheduler using Neural Network and Simulator based on Manufacturing System State file Kitae Kim    2001 
59 IC  PEDAC  A Shifting Bottleneck Procedure for Job-Shop Scheduling minimizing the Sum of Earliness and Tardiness Daeyoung Chung    2001 
58 IC  ICMA  Machine-Understandable e-Business Modeling with Ontology Tai-Woo Chang    2002 
57 IC  Asian eBiz  A Systematic Approach for Ontology-based e-Business Modeling Tai-Woo Chang    2002 
56 IC  SCSC  Performance Improvement Methodology for a Manufacturing System using Petri Nets and Simulation Analysis Kichang Lee    2002