Regresar

Mixed integer programming formulations for a non-preemptive parallel machine scheduling problem

Abstract:

The problem studied in this paper is motivated by the operations at the Internal Revenue Service of Ecuador. In this system, officials in charge must decide how many service counters must be active at any time to serve the incoming flow of customers and minimize the total number of man-hours that are necessary to serve such counters. This problem can be modeled as a multi-period non-preemptive parallel machine scheduling problem. In this research, two different integer programming formulations are proposed, where some lower bounds and valid inequalities are provided for both formulations. Moreover, computational results on real-world instances are reported.