An Application: A Model with Sequence Dependent Setup Times for Parallel Machines for the Die House Station in a White Goods Manufacturing Company

Abstract

Excessive buffer inventory may disrupt production and constitute one of the mainproblems. One of the ways of coping with the inventory problems in the massproduction lines is to achieve and implement a detailed production schedule. Inthis study, a company with a mass production line in the die house station of awhite goods sector is in consideration. A mixed-integer programming model withsequence-dependent setup times has been developed to solve the excessive work inprocess problems for the dye house station. The developed model has been appliedto the company to test the model by using real data and the problem has beensolved by using the General Algebraic Modeling System (GAMS) CPLEX 24,1solver. The optimal solution is obtained in 10 hours and 3 minutes. In the solution,the total earliness and tardiness time for 30 jobs is 4299 minutes.