A company has nine jobs that must be assigned to three ordered workstations. The file P08_39.xlsx lists the times required for each job, which are independent of the workstations they are assigned to. It also lists precedence relationships between the jobs. For example, job 2 is a precedent of job 5. This means that job 2 cannot be assigned to a higher-numbered workstation than job 5. Note that job 6 has two precedents, jobs 3 and 4, which means that neither of jobs 3 and 4 can be assigned to a higher-numbered workstation than job 6. The cycle time of the system is the maximum time load assigned to any workstation. Find an assignment of jobs to workstations that minimizes the cycle time without violating any of the precedence relationships.
A company has nine jobs that must be assigned to three ordered workstations. The file P08_39.xlsx lists the times required for each job, which are independent of the workstations they are assigned to. It also lists precedence relationships between the jobs. For example, job 2 is a precedent of job 5. This means that job 2 cannot be assigned to a higher-numbered workstation than job 5. Note that job 6 has two precedents, jobs 3 and 4, which means that neither of jobs 3 and 4 can be assigned to a higher-numbered workstation than job 6. The cycle time of the system is the maximum time load assigned to any workstation. Find an assignment of jobs to workstations that minimizes the cycle time without violating any of the precedence relationships.
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 7 images
