Read the following conference proceedings article by Bastian et al. (2015) titled, "Optimizing Forward Surgical Team Operating Room Scheduling for Mass Casualty Events:" Conference Proceedings Article.pdfDownload Conference Proceedings Article.pdf

In this problem, you will mimic the computational experiment using integer linear programming (ILP) to solve the FST OR scheduling problem for MASCAL events for two problem instances: 5 patients and 10 patients.

Using Microsoft Excel with OpenSolver, setup the spreadsheet model and solve the ILP for the two problem instances. You will need to use sub-schedule elimination constraints, as discussed in the article. Do not use the Evolutionary Solver.

PRO TIP:MKZ constraints are extremely difficult to implement in excel (example shown in Ragsdale 8.14). The best way to solve this in excel is to first solve it without any subtour elimination constraints. If you obtain a solution with a subtour, it is degenerate. Add the applicable subtour elimination constraint and re-solve (side 93). If the new solution is free of any subtours, this is your optimal solution! Iteratively add the applicable subtour constraints and re-solve until there are no subtours remaining. This approach works for problem 3A and 3B.

For each problem instance, report the optimal surgical schedule with minimal makespan (i.e., total surgical setup time). Here are the problem instance data:

Sij 1 2 3 4 5 1 0 20 15 8 6 2 15 0 18 9 28 3 24 23 0 13 13 4 15 27 8 0 14 5 8 17 24 15 0 Sij 1 2 3 4 5 6 7 8 9 10 1 0 9 12 26 11 24 12 13 17 15 2 24 0 28 23 22 5 7 18 9 23 3 19 30 0 30 15 22 25 15 28 15 4 18 10 27 0 28 12 16 19 22 7 5 5 16 11 7 0 25 27 30 23 15 6 7 26 6 17 6 0 28 10 13 28 7 23 26 20 20 24 30 0 16 18 27 8 23 20 22 8 18 10 14 0 14 12 9 7 13 9 19 29 27 18 23 0 30 10 16 10 11 11 28 26 6 11 12 0