Fieldwork scheduling is an optimization problem where we want to find the best assignment of tasks to the worker. We want to find a schedule that doesn't violate constraints and optimizes the criteria. We formally define and formulate the problem in the form of a mixed-integer linear program and solve it using the OR-Tools and SCIP libraries. We find that for problems with more than five tasks, the algorithm does not work fast enough, or rather, it does not work well enough with the given time limit. Because of that we propose a simplification of the problem, which reduces the time complexity enough so that also problems with more than five tasks can be solved quickly.
|
