A Mathematical Model-Based Methodology for Scheduling Multiple Concurrent Tasks

摘要

A mixed (binary) integer-linear programming model is developed discretely over time for scheduling tasks in a multitasking environment. The operator is assumed to be a single resource that attends to different tasks, but one at a time. As the model is proven to be NP-hard, an efficient solution algorithm, based on tabu search, is developed. Small to large size problems are solved, and the quality of solutions are compared with the optimal solution where it is found. In all cases, the tabu search-based algorithm had a much better time efficiency than branch-and-bound.