4 identical parallel machines 60 tasks. the data is given as follows, first column processing times,second due dates and weight. the problem is minimiing total weighted weightness. P4||sum(wjTj ) -.I need to use EDD RULE and solving on programming language.Matlab is preferred.I need code script. you can check problem 2 from uploded pdf.it was solved for single machine .this problem is for parallel machine,I need matlab code of it
4
60
81 987 9
73 865 6
92 964 10
62 1002 8
51 1150 6
90 670 9
85 1190 13
93 754 5
52 985 2
99 940 8
66 1014 10
59 694 9
41 679 7
66 604 5
46 911 14
43 874 4
92 1131 12
90 653 14
54 785 14
92 774 13
47 500 1
88 857 7
77 770 3
62 617 10
73 821 11
50 558 12
46 1160 11
86 705 4
42 1133 3
99 529 8
70 761 2
42 1125 8
73 874 7
86 1047 9
75 928 6
62 1043 3
73 634 5
93 1175 4
56 653 9
49 903 2
48 1096 12
93 901 4
76 767 7
61 611 5
95 715 12
53 1051 4
78 1138 9
49 510 7
64 1116 2
45 786 5
81 1015 3
54 578 2
57 550 6
89 635 8
61 689 13
87 570 2
56 1159 11
84 829 9
81 585 10
54 1053 13
Microsoft Word - ISYE474-574 Q #2 2021 key.docx ISYE574-474 Scheduling and Logistics Quiz #2 DUE DATE – Tuesday, March 09 @ Midnight Instructions Do not consult anybody. Be brief and precise, please. I NEED TO SEE YOUR WORK!! You MUST provide assumptions, formulas, graphs, flowcharts and reasoning for each situation. Everything that is written counts. Severe errors (and/or lengthy, irrelevant material) will earn you negative points. PUT YOUR NAME ON ALL PAGES AND NUMBER EACH PAGE. GOOD LUCK! The Quiz is due on Tuesday, March 09, at Midnight. You have to turn in your quiz through Blackboard. The link is provided for that and you HAVE to use that link and no other. (Anyway, keep a copy of your work!) Remember the format to provide an answer to each given problem is MS Words. In case you need to attach other files (Excel files), always you can upload one single zip file. Follow syllabus instructions to submit the files. Two (2) simple problems that will barely challenge your in-depth level of knowledge and intellect. Remember: Open book, mind, notes, but no friends or guest experts. Discussion questions should be answered completely but as brief as possible. Each problem is worth points as indicated. Problem Points Your score 1 45 2 10 3 25 4 10 Total 100 You are expected to do your own work, and must not discuss the problems or collaborate with other students. Use this sheet as a cover sheet for the examination and sign the following statement: “I certify that the work I have submitted is my own work and that I have not collaborated with any other students on this examination.” Name _______________________________ Signature: ______________________ Date: __________ ISYE574-474 Scheduling and Logistics Quiz #2 DUE DATE – Tuesday, March 09 @ Midnight Instructions: This Quiz is open book and notes. However, you must show your work to receive full credit for your answers. Write clearly all formulas and assumptions. No hand written answer in any form (scanned, pictured, etc.) will be accepted in this quiz. Type all your answers using MS Word, as well as use MS Equation to write equations and formulas. Important Note: Problem 3 is optional and extra credit for undergraduate students. Problem 1 (45 Points) Assume a company is interested in solving a scheduling problem for a bottleneck machine already identified, the idea is to reduce the work in process accumulated in front of the machine. The collected data is given in the table below. Jobs 1 2 3 4 5 6 7 8 9 10 Processing times 16 11 6 18 2 20 19 20 8 16 Release dates 22 6 0 6 21 7 29 121 64 48 a) Identify the objective function that you would like to use to solve this problem. Justify your response. (4 Points) The total completion time that is reduce total flow time b) Using the objective function identified in part (a), express this problem mathematically in the nomenclature as expressed in the class notes. (4 Points) 1|rj|∑Fj c) What dispatching rule will you use to satisfy your objective function? Justify your answer. (5 Points) Use SPT dispatching rule d) Use the dispatching rule from part c to solve for your objective function. Make sure to report the schedule as well as the objective function value. (27 Points) e) Does this dispatching rule guarantee the optimal solution? Use the notes on computational complexity to justify your answer as needed. (5 Points) The given dispatching rule does not guarantee the optimal solution. Problem 2 (10 Points) NASA has 10 especial activities to perform before committing a date for the next spatial expedition launch. Due to most of them are relevant for the next spatial mission, they have come to the conclusion that focusing on the reduction of the total weighted tardiness may produce a very good outcome. The data is the following: Jobs 1 2 3 4 5 6 7 8 9 10 pj 15 11 10 5 25 4 8 3 20 11 dj 71 76 73 88 47 59 24 55 23 47 wj 5 10 6 9 3 8 7 10 2 5 NASA wants you to describe the problem and generate a scheduling solution by using an appropriate rule. the maximum tardiness is 7-8-6-10-9-2-5-4-3-1. weighted tardiness of 500. Problem 3 (25 Points) A company is considering to schedule the following job set: Job i 1 2 3 4 5 6 7 8 9 10 pi 5 11 18 8 20 4 14 9 10 16 Find the sequence that minimize the sum of earliness and tardiness, assuming that the common due date is 65 days. First, we need to see whether the problem is unrestricted given the common due date, d=65 days. So, we organize the jobs using the LPT rule and calculate ∆=p[1] + p[3] + p[5] + p[7] + p[9], which is 61 days. Since d ≥ ∆, we conclude the problem is unrestricted and we proceed as indicated by Baker’s rule. The job in position [j*] = [5] should have a completion time, C[5]=65 days, as shown below. The objective function value, ∑(Ei + Ti), is equal to 213 days. Baker’s rule provides the optimal solution for this problem. Problem 3 (10 Points) Your boss hears you talking about a problem that is NP-hard, he does not understand this term. Explain to him with very simple words what NP-hard means. One explanation could be: “A problem is said to be NP when there is not an exact algorithm that can solve it to optimality, in polynomial time with respect to its size. Within this class, the current problem belongs to the hard ones.” Microsoft Word - ISYE474-574 Q #2 2021 key.docx ISYE574-474 Scheduling and Logistics Quiz #2 DUE DATE – Tuesday, March 09 @ Midnight Instructions Do not consult anybody. Be brief and precise, please. I NEED TO SEE YOUR WORK!! You MUST provide assumptions, formulas, graphs, flowcharts and reasoning for each situation. Everything that is written counts. Severe errors (and/or lengthy, irrelevant material) will earn you negative points. PUT YOUR NAME ON ALL PAGES AND NUMBER EACH PAGE. GOOD LUCK! The Quiz is due on Tuesday, March 09, at Midnight. You have to turn in your quiz through Blackboard. The link is provided for that and you HAVE to use that link and no other. (Anyway, keep a copy of your work!) Remember the format to provide an answer to each given problem is MS Words. In case you need to attach other files (Excel files), always you can upload one single zip file. Follow syllabus instructions to submit the files. Two (2) simple problems that will barely challenge your in-depth level of knowledge and intellect. Remember: Open book, mind, notes, but no friends or guest experts. Discussion questions should be answered completely but as brief as possible. Each problem is worth points as indicated. Problem Points Your score 1 45 2 10 3 25 4 10 Total 100 You are expected to do your own work, and must not discuss the problems or collaborate with other students. Use this sheet as a cover sheet for the examination and sign the following statement: “I certify that the work I have submitted is my own work and that I have not collaborated with any other students on this examination.” Name _______________________________ Signature: ______________________ Date: __________ ISYE574-474 Scheduling and Logistics Quiz #2 DUE DATE – Tuesday, March 09 @ Midnight Instructions: This Quiz is open book and notes. However, you must show your work to receive full credit for your answers. Write clearly all formulas and assumptions. No hand written answer in any form (scanned, pictured, etc.) will be accepted in this quiz. Type all your answers using MS Word, as well as use MS Equation to write equations and formulas. Important Note: Problem 3 is optional and extra credit for undergraduate students. Problem 1 (45 Points) Assume a company is interested in solving a scheduling problem for a bottleneck machine already identified, the idea is to reduce the work in process accumulated in front of the machine. The collected data is given in the table below. Jobs 1 2 3 4 5 6 7 8 9 10 Processing times 16 11 6 18 2 20 19 20 8 16 Release dates 22 6 0 6 21 7 29 121 64 48 a) Identify the objective function that you would like to use to solve this problem. Justify your response. (4 Points) The total completion time that is reduce total flow time b) Using the objective function identified in part (a), express this problem mathematically in the nomenclature as expressed in the class notes. (4 Points) 1|rj|∑Fj c) What dispatching rule will you use to satisfy your objective function? Justify your answer. (5 Points) Use SPT dispatching rule d) Use the dispatching rule from part c to solve for your objective function. Make sure to report the schedule as well as the objective function value. (27 Points) e) Does this dispatching rule guarantee the optimal solution? Use the notes on computational complexity to justify your answer as needed. (5 Points)