A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
Year of publication: |
2014
|
---|---|
Authors: | Ozturk, Onur ; Begen, Mehmet A. ; Zaric, Gregory S. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 239.2014, 1 (16.11.), p. 214-226
|
Subject: | OR in health services | Parallel batch scheduling | Makespan | Branch and bound heuristic | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Krankenhaus | Hospital | Theorie | Theory | Durchlaufzeit | Lead time | Branch-and-Bound | Branch and Bound | Operations Research | Operations research |
-
Ozturk, Onur, (2017)
-
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Fomin, Artem, (2022)
-
Minimizing maximum tardiness on a single machine with family setup times and machine disruption
Molaee, Ehsan, (2021)
- More ...
-
Ozturk, Onur, (2014)
-
Ozturk, Onur, (2017)
-
Naderi, Bahman, (2023)
- More ...