Parallel machines scheduling problem with sequence dependent set up times: A case of Bosch Vietnam

Abstract

Unrelated parallel machines with sequence-dependent set-up time is studied in this thesis with the case of Bosch Vietnam. The aim of this study is to improve the effectiveness of production system by shortening the maximum completion time as well as the earliness and tardiness penalties. A mixed integer programming (MIP) model was applied to solve such problem with small size of data set. In addition, the thesis also developed an algorithm called Initial Sequence based on Earliness and Tardiness criterion on Parallel machines (ISETP) proposed by the key reference. By combining Genetic Algorithm to generate the priority of job sequence, the new proposed ISETP is used to solve the scheduling problem with larger scale. Keywords: Unrelated parallel machines, Scheduling, SDST, Just-In-Time (JIT), makespan.