An optimal policy for joining a queue in processing two kinds of jobs
| Autor: | Hajime Kawai, Junji Koyanagi |
|---|---|
| Rok vydání: | 2003 |
| Předmět: |
Job scheduler
ComputingMilieux_THECOMPUTINGPROFESSION Operations research Computer science Process (engineering) Distributed computing Joins Dynamic programming computer.software_genre Optimal joining Monotone policy Job queue Computational Mathematics Task (computing) Computational Theory and Mathematics Modelling and Simulation Modeling and Simulation computer Queue Job stream |
| Zdroj: | Computers & Mathematics with Applications. 46:1081-1087 |
| ISSN: | 0898-1221 |
| DOI: | 10.1016/s0898-1221(03)90122-2 |
| Popis: | We deal with a situation where a worker processes two kinds of jobs, job A and job B. Job A is processed in a certain queueing system, and job B is processed separately from the queueing system if the worker is not in the queueing system. The process of job B consists of several tasks. The number of the tasks is distributed and each task needs a constant time. At each end of task, the worker can know whether all tasks are completed, and a decision is made whether the process of job B is suspended to join the queue. If the process of job B is suspended, the worker joins the queue and the residual tasks are processed after job A has been processed. The objective is to minimize the expected time until two jobs are completed. We prove a monotone property of the optimal policy by a dynamic programming formulation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect