A STUDY ON A TWO-MACHINES FLOWSHOP BATCH SCHEDULING PROBLEM WITH NON-IDENTICAL JOB SIZES

• Main Authors: Jen-Hao Tsai, 蔡仁皓
• Other Authors: Dar-Li Yang
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/43qdmz

碩士 === 國立虎尾科技大學 === 工業工程與管理研究所 === 95 === The domestic semiconductor industry expands rapidly, batch processing machines are commonly used in burn-in operations. This paper proposes two mixed integer formulation models to schedule batches of jobs on two machines in a flow shop. Then, GA and SA are applied to the batch scheduling problem. A set of jobs with known processing times and sizes has to be grouped, to form batches, in order to be processed on the batch processing machines. Each machine can process a batch as long as the total size of a batch is less than the machine capacity. The processing time of a batch is the longest processing time of all the jobs in that batch. Mixed integer formulation models are proposed when the buffer capacity is unlimited or zero. This research aims at minimizing the makespan for a batch processing machine. Random instances were used to test the effectiveness of the proposed approach. The results obtained from GA were compared with a SA approach and Lingo. The results indicate that the GA was able to arrive at better makespan with shorter run times.