Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Multitasking Scheduling With Shared Processing, Bin Fu, Yumei Huo, Hairong Zhao
Multitasking Scheduling With Shared Processing, Bin Fu, Yumei Huo, Hairong Zhao
Computer Science Faculty Publications and Presentations
Recently, the problem of multitasking scheduling has raised a lot of interest in the service industries. Hall et al. (Discrete Applied Mathematics, 2016) proposed a shared processing multitasking scheduling model which allows a team to continue to work on the primary tasks while processing the routinely scheduled activities as they occur. With a team being modeled as a single machine, the processing sharing of the machine is achieved by allocating a fraction of the processing capacity to routine jobs and the remaining fraction, which we denote as sharing ratio, to the primary jobs. In this paper, we generalize this model …
Streaming Approximation Scheme For Minimizing Total Completion Time On Parallel Machines Subject To Varying Processing Capacity, Bin Fu, Yumei Huo, Hairong Zhao
Streaming Approximation Scheme For Minimizing Total Completion Time On Parallel Machines Subject To Varying Processing Capacity, Bin Fu, Yumei Huo, Hairong Zhao
Computer Science Faculty Publications and Presentations
We study the problem of minimizing total completion time on parallel machines subject to varying processing capacity. In this paper, we develop an approximation scheme for the problem under the data stream model where the input data is massive and cannot fit into memory and thus can only be scanned a few times. Our algorithm can compute an approximate value of the optimal total completion time in one pass and output the schedule with the approximate value in two passes.