In a chemistry laboratory one of the machines has five different ways of being set up...

Transcribed Image Text:

In a chemistry laboratory one of the machines has five different ways of being set up to perform different test, A, B, C, D, and E. Every day the laboratory needs to run some of each of the tests. The times to switch between the set ups is given in the table below. A B Ce De E ? A -* 140 30 9e 8Pe -* 10 11 30P Ce De -* 130e E Given that the machine starts the day in state A, and must end in A to be cleaned in what order should the types of tests be performed? (a) What type of operations research problem is this?e (b) Find a solution to this problem using an appropriate algorithm. Give the name and the type of algorithm that you have used as well as the total time spent changing the set up of the machine. (c) Name the appropriate algorithm, taught in class, to improve your solution from (b), and carry out one iteration of this algorithm on the best solution found in part (b). (d) Are either of the solutions generated in parts (b) or (c) guaranteed to be optimal? Why or why not? (e) Suggest a reason why the solutions generated in parts (b) and (c) may not be realistic. In a chemistry laboratory one of the machines has five different ways of being set up to perform different test, A, B, C, D, and E. Every day the laboratory needs to run some of each of the tests. The times to switch between the set ups is given in the table below. A B Ce De E ? A -* 140 30 9e 8Pe -* 10 11 30P Ce De -* 130e E Given that the machine starts the day in state A, and must end in A to be cleaned in what order should the types of tests be performed? (a) What type of operations research problem is this?e (b) Find a solution to this problem using an appropriate algorithm. Give the name and the type of algorithm that you have used as well as the total time spent changing the set up of the machine. (c) Name the appropriate algorithm, taught in class, to improve your solution from (b), and carry out one iteration of this algorithm on the best solution found in part (b). (d) Are either of the solutions generated in parts (b) or (c) guaranteed to be optimal? Why or why not? (e) Suggest a reason why the solutions generated in parts (b) and (c) may not be realistic.

Answer rating: 100% (QA)

A Sequencial shifting B Shortest time first STP C A B C D E A 14 3 9 8 B 1 11 3 C 7 3 D 13 E Time ... View the full answer