The Identical Parallel Machine Scheduling Problem with Setups and Additional Resources

This paper studies a real world dedicated parallel machine scheduling problem with sequence dependent setups, different machine release dates and additional resources (PMSR). To solve this problem, two previously proposed models have been adapted and a novel objective function, the minimisation of the sum of the machine completion times, is proposed to reflect the real conditions of the manufacturing environment that motivates this work. One model follows the strip-packing approach and the other is time-indexed. The solutions obtained show that the new objective function provides a compact production schedule that allows the simultaneous minimisation of machine idle times and setup times. In conclusion, this study provides valuable insights into the effectiveness of different models for solving PMSR problems in real-world contexts and gives directions for future research in this area using complementary approaches such as matheuristics.