A Study of Job Shop Scheduling Problem with Parallel Machine and Reentrant Process

碩士 === 中原大學 === 工業工程研究所 === 94 === This research developed a scheduling algorithm for Job Shop Scheduling Problem with reentrant characteristics and parallel machines of different production rates. This algorithm has four modules: input module, machine selection module, scheduling module, and outpu...

Full description

Bibliographic Details
Main Authors: Jheng-Jynn Wu, 吳政俊
Other Authors: James Chien-Liang Chen
Format: Others
Language:zh-TW
Published: 2006
Online Access:http://ndltd.ncl.edu.tw/handle/96664937922864876283
Description
Summary:碩士 === 中原大學 === 工業工程研究所 === 94 === This research developed a scheduling algorithm for Job Shop Scheduling Problem with reentrant characteristics and parallel machines of different production rates. This algorithm has four modules: input module, machine selection module, scheduling module, and output module. An order has several jobs and each job has several operations in a hierarchical structure. Machine selection module helps an operation to select one of the parallel machines to process it by using Grouping Genetic Algorithm (GGA). Scheduling module is then used to schedule the sequence and timing of all operations assigned to each machine by using Genetic Algorithm (GA). A multiple objective function including makespan, total tardiness, and total machine idle time is used to evaluate the performance of the proposed algorithm in a real weapon production factory. Based on the design of experiments, the setting of mutation rate and initial solution of GGA and GA are identified as significant factors affecting the scheduling performance. The proposed GGA and GA algorithm outperforms the other scheduling methods combining different dispatching rules.