A mathematical modeling framework for scheduling and managing multiple concurrent tasks

• Main Author: Shakeri, Shakib
• Other Authors: Logendran, Rasaratnam
• Language: en_US
• Published: 2012
• Subjects: Task analysis > Mathematical models; Decision making > Mathematical models; Management science > Mathematical models
• Online Access: http://hdl.handle.net/1957/31165

Occurrence of human error in highly complex systems, such as a cockpit, can be disastrous and/or overwhelmingly costly. Mismanagement of multiple concurrent tasks has been observed by researchers to be a type of repetitive human error in previous studies of accidents and incidents. This error may occur in the form of wrong selection of a strategy to attend to tasks, and/or wrong assessment of a task's priority at each moment. The desire to prevent such errors forms two essential questions: 1) Is there any (near) optimal method of managing multiple concurrent tasks? 2) How optimally do human operators manage these tasks? To answer the first question, operations research as it is applied to single machine scheduling was used. The operator was assumed to be a single resource that attended to different tasks, one at a time. To answer the second question, a software environment was developed to measure the human's multitasking performance, which was then compared with the answer to question one. In this research, the operator's quality of performance was maximized as opposed to the number of tasks accomplished, which was considered by previous researchers. A metaphor of 'Juggler and spinning plates' along with a graphic bar illustration was used to resemble an operator (a juggler) who manages several tasks (plates on vertical poles) concurrently. Several mixed (binary) integer-linear programming models were developed discretely over time. One model was selected and solved by the means of tabu search heuristic method. In tabu search, the significance of different initial solution finding mechanisms and different applications of long-term memory was investigated. A conjecturing method, within the tabu search, was introduced for solving problems with very large planning horizons. In all cases, tabu search gave good quality solutions in a much shorter time than branch-and-bound. Under five different scenarios, ten subjects were studied while managing multiple concurrent tasks in the software environment. None of the subjects could gain a score better than tabu search in any of the scenarios. Subjects' patterns of attendance to tasks were analyzed and compared against the pattern suggested by tabu search, and similarities/differences were identified. === Graduation date: 2003