Job Scheduling in a Multi-layer Vision System

We consider job scheduling in a multi-layer vision system. We model this problem as scheduling a number of jobs, which are made of multiprocessor tasks, with arbitrary processing times and arbitrary processor requirements in a two-layer system. Our objective is to minimize the makespan. We have developed several heuristic algorithms that include simple sequencing and scheduling rules. The computational experiments show that three of these heuristic algorithms are efficient.