Single Machine Scheduling Problem with Sequence Dependent Setup Times: An Application in White Goods Industry

In this study, single machine scheduling problem with sequence dependent setup times was studied in the dyehouse department of a company operating in the white goods sector. It is aimed to provide the most suitable sequence by taking into consideration the setup times due to the processing time, delivery time and color change of each product to be painted.The goal programming model, which aims to minimize the makespan and total delay time, has been developed and solved in the GAMS/CPLEX optimization program.Because the problem is NP-hard, using the LEKIN program to solve large-scale problems, different priority rules such as; SPT (shortest processing time), LPT (longest processing time), EDD (earliest due date) and FCFS (first come first serve) which are widely used in literature have been applied.The results obtained from the mathematical model were compared and interpreted with the results obtained from the rules