Makespan minimisation on parallel batch processing machines with non-identical job sizes and release dates

作者：Ozturk Onur; Espinouse Marie Laure^*; Di Mascolo Maria; Gouin Alexia

来源：International Journal of Production Research, 2012, 50(20): 6022-6035.

DOI：10.1080/00207543.2011.641358

• batch scheduling
• batch processing
• heuristics
• makespan
• mixed integer linear programming
• parallel batch scheduling
• approximation algorithm
• sterilisation service

The problem we study in this paper arises from the washing step of hospital sterilisation services. Washers in the washing step are capable of handling more than one medical device set as long as their capacity is not exceeded. The medical device set sizes and arrival times to the sterilisation service may be different, but they all have the same washing duration. Thus, we model the washing step as a batch scheduling problem where medical device sets are treated as jobs with non-identical sizes and release dates, but equal processing times. The main findings we present in this paper are the following. First, we study two special cases for which polynomial algorithms are presented. We then develop a 2-approximation algorithm for the general problem. Finally, we develop a MILP model and compare it with another MILP model from the literature. Computational results show that our MILP model outperforms the model from the literature.

• 出版日期2012