Home > Back-end >  C language data structure for help ~ ~ ~ ~
C language data structure for help ~ ~ ~ ~

Time:10-12

5. The problem of plant simulation,
Suppose you have a factory, made up of m=3 machine, n=4 tasks now,
Task 1: there are three working procedure, and so on the first machine to perform 2 hours, and then perform four hours on 2 machine, finally performed 1 hour on the first machine, use (1, 2), (2, 4), (1, 1) respectively 3 procedures performed on different machines,
Task 2: process for 2, respectively (3, 4) (1, 2);
Task 3: process for 2, respectively (1, 4) and (2, 4)
Task 4: process for 2, respectively (3, 1) and (2, 3)
Each machine work after the completion of the transformation of the state respectively, 2, 1 time unit, assume that all four tasks are now at zero moment, and no new task in the process of task to complete, how long does it take to ask each task completion?
  • Related