Consider a two machine job shop scheduling problem with 10 jobs to be processed on machines A and/or B. The routing information and processing times of these jobs are given in the table below. Find the schedule that minimizes the makespan. Draw a Gantt chart for the optimum schedule and report the corresponding makespan value. Job Routing Information 1 2 3 4 5 6 7 8 9 10 B A B B A A B BA A B B B A A A 2 5 2 6 1 2 - 5 4 Processing Time B 3 5 4 - 2 4 5 6 3