Non-preemptivePeteghem et al. [1] considered resource-constrained project scheduling problem (RCPSP) with preemptive activities. However, some points should be made clear. How and when an activity is divided? How many parts an activity should be splitted? Whether the preemptive-based scenario...
and then resumed with no cost, the problem can b e solv ed in p olynomial time using the Shortest Remaining Pro cessing Time (S RP T ) algo- rithm: alw a ys run a job with the shortest remaining pro cessing time [1]. A 2-appro ximation algorithm for the problem w as dev elo...
Approximation algorithms Speed-scaling Non-preemptive scheduling 1. Introduction One of the main mechanisms used for minimizing the energy consumption in computing systems and portable devices is the so called speed-scaling mechanism [1], where the speed of a processor may change dynamically. If the...
Goldwasser, M.H., Pedigo, M.: Online, non-preemptive scheduling of equal-length jobs on two identical machines. In: Proc. 10th Scandinavian Workshop on Algo- rithm Theory (SWAT). Volume 4059 of Lecture Notes in Comput. Sci., Springer (2006) 113-123...
Eric Torng and Patchrawat Uthaisombut. Lower bounds for srpt-subsequence algo- rithms for nonpreemptive scheduling. Manuscript, July 1998.E. Torng and P. Uthaisombut. Lower bounds for srpt-subsequence algorithms for nonpreemp- tive scheduling. Manuscript, July 1998....
Goldwasser, M.H., Pedigo, M.: Online, non-preemptive scheduling of equal-length jobs on two identical machines. In: Proc. 10th Scandinavian Workshop on Algo- rithm Theory (SWAT). Volume 4059 of Lecture Notes in Comput. Sci., Springer (2006) 113-123...
An O(n 4 ) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs - Baptiste - 1999 () Citation Context ...ng to see whether the running time of our algo- rithm, as well as the running time of the algorithm for the non-preemptive version of ...
E. Shchepin and N. Vakhania, “Little-preemptive scheduling on unrelated processors,” J. Math. Model. Algorithms 1 , 43–56 (2002). MATH MathSciNetE. Shchepin and N. Vakhania, "Little-preemptive scheduling on unrelated processors," J. Math. Model. Algo- rithms 1, 43-56 (2002)...
We improve complexity bounds for energy-efficient non-preemptive scheduling problems for both the single processor and multi-processor cases. As energy conservation has become a major concern, traditional scheduling problems have been revisited in the past few years to take into account the energy ...