A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
DOI10.1016/J.EJOR.2014.05.014zbMATH Open1339.90149OpenAlexW2057898175MaRDI QIDQ297101FDOQ297101
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
Recommendations
- A bi-criteria optimization model for medical device sterilization
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Cites Work
- Scheduling with batching: A review
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Worst-case analysis of the subset sum algorithm for bin packing.
- Efficient scheduling algorithms for a single batch processing machine
- Batching identical jobs
- A constraint programming approach for a batch processing problem with non-identical job sizes
- 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
- 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
- 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
Cited In (6)
- Arc-flow approach for single batch-processing machine scheduling
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- Optimization of logistics services in hospitals
- Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem
This page was built for publication: A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297101)
