Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

Abstract

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed a two-objective model to solve JSP with sequence-dependent setup times (SDST). Considering SDST and optimizing of the both objectives simultaneously (makespan and maximum tardiness) bring us closer to natural-world problems. The ε-constraint method is applied to solve the mentioned two-objective model. A set of numerical data is generated and tested to validate the model's efficiency and flexibility. The developed model can efficiently use for solving JSPs in the real world, especially for manufacturing companies with having setup and delivery time's constraints.