Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these constraints we show that the problem of optimal scheduling of sparse instances can be solved in polynomial time.
KeywordsAvailability Constraint Test Schedul Pendant Edge Optimal Coloring Multiprocessor Task
Unable to display preview. Download preview PDF.
- 7.Gehringer, E.F., Siewiorek, D.P., Segall, Z.: Parallel Processing: The Cm* Experience. Digital Press, Bedford (1987)Google Scholar
- 10.Giaro, K., Kubale, M., Piwakowski, K.: Complexity results on open schop scheduling to minimize total cost of operations. Intern. J. Comp. Sys. Sign. 3, 84–91 (2002)Google Scholar