Details

Autor(en) / Beteiligte

• Ozturk, Onur
• Begen, Mehmet A.
• Zaric, Gregory S.

Titel

A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services

Ist Teil von

• European journal of operational research, 2014-11, Vol.239 (1), p.214-226

Ort / Verlag

Amsterdam: Elsevier B.V

Erscheinungsjahr

2014

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• •Parallel batch scheduling approach for hospital sterilization services.•A branch and bound based heuristic method is developed.•Our algorithm, BBH, can solve real-world size instances with short computation time.•BBH outperforms the current state of the art solution methods for most of the problem instances. In this paper, we address the problem of parallel batching of jobs on identical machines to minimize makespan. The problem is motivated from the washing step of hospital sterilization services where jobs have different sizes, different release dates and equal processing times. Machines can process more than one job at the same time as long as the total size of jobs in a batch does not exceed the machine capacity. We present a branch and bound based heuristic method and compare it to a linear model and two other heuristics from the literature. Computational experiments show that our method can find high quality solutions within short computation time.