Abstract
We consider the classic problem of preemptively scheduling jobs of unknown size (a.k.a. service time) in a queue to minimize mean number-in-system, or equivalently mean response time (a.k.a. sojourn time). We know how to solve this problem in an M/G/1, provided the job size distribution is known to the scheduler. In this case, the optimal policy is the Gittins policy (a.k.a. Gittins index policy) [1].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
