On the single machine scheduling problem with sequence-dependent setup times and periodic maintenance

摘要

This paper tackles the single machine scheduling problem with sequence-dependent setup times and periodic maintenance. The objective function to be minimized here is the weighted sum of completion times using mixed integer programming approaches. We propose and analyze herein two mixed-integer linear programming (MILP) formulations. The performance of these MILPs is tested on randomly generated data sets.