Solving single and bi-objective surgery scheduling problems using local search heuristic

Solving single and bi-objective surgery scheduling problems using local search heuristic

Due to the increasing number of elective patients required for surgery, the higher demand for an efficient and effective operating room planning in the health care sector is needed. Thus, better operating room planning is needed to prevent any complication to the patients for waiting too long for th...

Full description

Saved in:
Bibliographic Details
Main Author: Ab Rashid, Nur Shafiqah
Format: Thesis
Language:English
Published: 2021
Subjects:
Heuristic algorithms
Heuristic programming
Online Access:http://psasir.upm.edu.my/id/eprint/92760/1/FS%202021%2043%20IR.pdf
http://psasir.upm.edu.my/id/eprint/92760/
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Putra Malaysia
Language: English

Internet

http://psasir.upm.edu.my/id/eprint/92760/1/FS%202021%2043%20IR.pdf
http://psasir.upm.edu.my/id/eprint/92760/

Similar Items