Affiliation:
1. Seoul National University
2. Seoul National University (ASRI)
3. Seoul National University (South Korea)
Abstract
One method of dedicated robots task allocation has selected a task to be assigned after comparing the results when tasks are allocated to robots, respectively. Thus, quick and accurate prediction of makespan is important for enhancing the be solved in polynomial time. In this paper, the makespan prediction is mathematically analyzed and a greed algorithm is suggested on the basis of the analysis. The effectiveness of the makespan prediction algorithm was verified by simulation in comparison with the complete enumeration.
Publisher
Trans Tech Publications, Ltd.
Reference14 articles.
1. J.D. Jeon, J.S. Choi, W.S. Yoo and B.H. Lee: Dynamic Task Allocation for Three Dedicated Heterogeneous Robots Cooperation, The 7th Korea Robotics Society Annual Conference (2012) pp.405-408 (in Korean).
2. R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G.R. Kan: Optimization and Approximation in Deterministic Sequencing and Scheduling: A survey, Annals of Discrete Mathematics 5 (1979), pp.287-326.
3. J. Błzewicz, P. Dell'Olmo, M. Drozdowski and M.G. Speranza: Scheduling multiprocessor tasks on three dedicated processors, Information Processing Letters 41 (1992), pp.275-280.
4. J.A. Hoogeveen, S.L. van de Velde and B. Veltman: Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathmatics 55 (1994), pp.259-272.
5. P. Dell'Olmo, M.G. Speranza and Zs. Tuza: Efficiency and effectiveness of normal schedules on three dedicated processors, Discrete Mathematics 164 (1997), pp.67-79.