LAUSR

Abstract This paper deals with a dynamic scheduling problem where a production schedule must be adapted to cope with the arrival of new orders. The problem encompasses several identical parallel machines with sequence-dependent setup times and a release date for each job. The problem’s goal is to minimize both the makespan and the total tardiness of the jobs. A Mixed Integer Linear Programming model is used to generate the initial schedule and then, every time a new order arrives, the MIP is executed again but considering the new order plus the orders not completed so far executed. The results produced for a tested of 16 different problems are analyzed according to two parameters: (1) the number of new jobs arriving to the system, and (2) the relative weight granted to each of the objectives.