Mixed integer programming based heuristics for the Patient Admission Scheduling problem

详细信息    查看全文

• 作者：Aykut Melih Turhan^a ; Bilge Bilgen^b ; ^{bilge.bilgen@deu.edu.tr}
• 关键词：OR In Health Services ; Patient Admission Scheduling ; MIP based heuristics ; Fix-and-Relax ; Fix-and-Optimize
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：April 2017
• 年：2017
• 卷：80
• 期：Complete
• 页码：38-49
• 全文大小：2159 K
• 卷排序：80

文摘

Patient Admission Scheduling problem is solved via MIP based heuristics. Initial solution is found by the Fix and Relax heuristic. Initial solution is further improved by the Fix and Optimize heuristic. Algorithm is very efficient and computational time is much lower than literature. Gap to the best known results is 15 percent on an average.