Job-shop Scheduling Applied to Computer Vision
J.M. Sebastián, F.Torres, R.Aracil, O.Reinoso, L.M.Jiménez, D.García
Proceedings of International Symposium on Parallel and Distributed Methods for Image Processing (SPIE Proceedings)  (San Diego, California (USA) July 1997)
 ISBN:9780819425881  ISSN:0277-786X - 0361-0748  DOI:10.1117/12.279613  - Volume 3166, pp 158 – 169


Job-shop scheduling applied to computer vision J.Mª.Sebastián(1), F.Torres(2), R.Aracil(1), O.Reinoso(1), L.M.Jiménez(2), D. García(1) (1)Dept. Engineering System and Automatica, UPM, Spain (2)Dept. Engineering System and Communicactions, UA, Spain ABSTRACT This paper presents a method for minimizing the total elapsed time spent by n tasks running on m differents processors working in parallel. The developed algorithm not only minimizes the total elapsed time but also reduces the idle time and waiting time of in-process tasks. This condition is very important in some applications of computer vision in which the time to finish the total process is particularly critical -quality control in industrial inspection, real-time computer vision, guided robots, .... The scheduling algorithm is based on the use of two matrices, obtained from the precedence relationships between tasks, and the data obtained from the two matrixes. The developed scheduling algorithm has been tested in one application of quality control using computer vision. The results obtained have been satisfactory in the application of different image processing algorithms. Keywords: scheduling, computer vision, real-time, parallel processing, priority algorithm.