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

DOI10.1016/j.ejor.2014.05.014zbMath1339.90149OpenAlexW2057898175MaRDI QIDQ297101

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

Publication date: 24 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.05.014

zbMATH Keywords

makespanOR in health servicesbranch and bound heuristicparallel batch scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)

Related Items (5)

Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time ⋮ Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization ⋮ Optimization of logistics services in hospitals

Cites Work

• Unnamed Item
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
• Efficient scheduling algorithms for a single batch processing machine
• Batching identical jobs
• Worst-case analysis of the subset sum algorithm for bin packing.
• A constraint programming approach for a batch processing problem with non-identical job sizes
• Scheduling with batching: A review
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Minimizing the makespan on a single parallel batching machine
• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
• Minimizing makespan on a single batching machine with release times and non-identical job sizes
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling a single batch processing machine with non-identical job sizes
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure

This page was built for publication: A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services