A weight-based algorithm to deal with due dates in flexible package production scheduling

Abstract

This paper is an extension of a previous paper published in [2]. In this problem it is necessary to schedule several jobs that involve four process and for each one of them there is a group of machines available (of similar characteristics). Each activity is performed on just one machine. Besides, for our application, the scheduling must try to verify certain conditions. For each process (and consequently for all the activities that perform this process) there is a list of attributes. The problem is not only to assign each activity to a starting time and to a specific machine, but also to try to verify conditions that depend on the values of the attributes of the activities. Moreover, there are criteria to choose a particular machine An approach to solve this problem was presented first in [1]. As mentioned there, some due dates could not be fulfilled on time. An approach to decrease the quantity of due dates violations was presented in [2]. Roughly speaking, the algorithm presented in [1] is entirely dedicated to verify as many conditions as possible disregarding due dates violations. By the other hand, the algorithm shown in [2] was focussed to reduce the numer of due dates violations paying the price of decreasing the fulfillment of conditions. Roughl speaking, the first approach favour the company whereas the second one is more convenient for the customers. The present work includes an algorithm which allows to assign weights to set an appropriate trade-off between due date violations reduction and fulfillment of conditions