Abstract
We consider optimal job scheduling where each job consists of multiple tasks, each of unknown duration, with precedence constraints between tasks. A job is not considered complete until all of its tasks are complete. Traditional heuristics, such as favoring the job of shortest expected remaining processing time, are suboptimal in this setting. Furthermore, even if we know which job to run, it is not obvious which task within that job to serve. In this paper, we characterize the optimal policy for a class of such scheduling problems and show that the policy is simple to compute.
- S. Aalto, U. Ayesta, and R. Righter. On the Gittins index in the M/G/1 queue. Queueing Systems, 63(1):437--458, 2009. Google ScholarDigital Library
- N. Dragoni et al. Microservices: yesterday, today, and tomorrow. 2016. arXiv:1606.04036.Google Scholar
- J. Gittins, K. Glazebrook, and R. Weber. Multi-armed bandit allocation indices. John Wiley & Sons, 2011.Google ScholarCross Ref
- J. C. Gittins and D. M. Jones. A dynamic allocation index for the sequential design of experiments. In J. Gani, editor, Progress in Statistics, pages 241--266. North-Holland, Amsterdam, NL, 1974.Google Scholar
- A. Toumi et al. Design and optimization of a large scale biopharmaceutical facility using process simulation and scheduling tools. Pharmaceutical Engineering, 30(2):1--9, 2010.Google Scholar
- J. D. Ullman. NP-complete scheduling problems. Journal of Computer and System Sciences, 10(3):384--393, 1975. Google ScholarDigital Library
- P. Whittle. Multi-armed bandits and the Gittins index. Journal of the Royal Statistical Society. Series B (Methodological), pages 143--149, 1980.Google ScholarCross Ref
- M. Zaharia et al. Resilient distributed datasets: A faulttolerant abstraction for in-memory cluster computing. In NSDI '12. USENIX Association, 2012. Google ScholarDigital Library
Index Terms
Optimally Scheduling Jobs with Multiple Tasks
Recommendations
On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
We consider the problem of scheduling n unit-time jobs with multiple release time/deadline intervals, which are intervals of time in which the job can be scheduled. A feasible schedule is one in which each job is run in its entirety within one of its ...
Scheduling jobs under decreasing linear deterioration
This paper considers the scheduling problems under decreasing linear deterioration. Deterioration of a job means that its processing time is a function of its execution start time. Optimal algorithms are presented respectively for single machine ...
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
In this paper, we consider the problem of scheduling n deteriorating jobs with release dates on a single (batching) machine. Each job's processing time is a simple linear function of its starting time. The objective is to minimize the maximum lateness. ...
Comments