Makespan minimisation on parallel batch processing machines with non-identical job sizes and release dates |
| |
Authors: | Onur Ozturk Maria Di Mascolo Alexia Gouin |
| |
Affiliation: | 1. Grenoble-INP/UJF-Grenoble 1/CNRS, G-SCOP, UMR5272 , Grenoble F-38031 , France (Grenoble-Science pour la Conception, l'Optimisation et la Production);2. Grenoble-INP/UJF-Grenoble 1/CNRS, GIPSA-lab, UMR 5216 , St. Martin D'Hères F-38402 , France (Laboratoire Grenoblois de l'Image, de la Parole, du Signal et de l'Automatique) |
| |
Abstract: | 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. |
| |
Keywords: | batch scheduling batch processing heuristics makespan mixed integer linear programming parallel batch scheduling approximation algorithm sterilisation service |
|
|