Blog

Q9) Please show your work in the file submission to receive partial credit. An MRP system is used to plan production for a finished product. The planned lead time for the product is 3 weeks. The system uses Lot-for-Lot production. Determine the Planned Order Releases for weeks 1 – 6. Please fill in the Scheduled Receipts, the Net Requirements, and the Planned Order Releases below.   Week 0 Week 1 Week 2 Week 3 Week 4 Week 5 Week 6 Gross Requirements   2543 1734 3110 2412 3541 1892 Scheduled Receipts/On-hand 7000             Net Requirements               Planned Order Releases             On-Hand Week 1 = [OnHandW1];      On-Hand Week 2 = [OnHandW2]; On-Hand Week 3 = [OnHandW3];      On-Hand Week 4 = [OnHandW4]; On-Hand Week 5 = [OnHandW5];      On-Hand Week 6 = [OnHandW6]; Net Req. Week 1 = [NetW1];      Net Req. Week 2 = [NetW2]; Net Req. Week 3 = [NetW3];      Net Req. Week 4 = [NetW4]; Net Req. Week 5 = [NetW5];      Net Req. Week 6 = [NetW6]; POR Week 0 = [PORW0];     POR Week 1 = [PORW1]; POR Week 2 = [PORW2];     POR Week 3 = [PORW3]; POR Week 4 = [PORW4];     POR Week 5 = [PORW5]; POR Week 6 = [PORW6];

Q9) Please show your work in the file submission to receive partial credit. An MRP system is used to plan production for a finished product. The planned lead time for the product is 2 weeks. The system uses Lot-for-Lot production. Determine the Planned Order Releases for weeks 1 – 6. Please fill in the Scheduled Receipts, the Net Requirements, and the Planned Order Releases below.   Week 0 Week 1 Week 2 Week 3 Week 4 Week 5 Week 6 Gross Requirements   2222 3333 4444 5555 6666 7777 Scheduled Receipts/On-hand 14034             Net Requirements               Planned Order Releases             On-Hand Week 1 = [OnHandW1];      On-Hand Week 2 = [OnHandW2]; On-Hand Week 3 = [OnHandW3];      On-Hand Week 4 = [OnHandW4]; On-Hand Week 5 = [OnHandW5];      On-Hand Week 6 = [OnHandW6]; Net Req. Week 1 = [NetW1];      Net Req. Week 2 = [NetW2]; Net Req. Week 3 = [NetW3];      Net Req. Week 4 = [NetW4]; Net Req. Week 5 = [NetW5];      Net Req. Week 6 = [NetW6]; POR Week 0 = [PORW0];     POR Week 1 = [PORW1]; POR Week 2 = [PORW2];     POR Week 3 = [PORW3]; POR Week 4 = [PORW4];     POR Week 5 = [PORW5]; POR Week 6 = [PORW6];

Q8) Please show your work in the file submission to receive partial credit. A small plant produces 3 different products, A B C, and they use a Kanban pull system. The demand for the A is 100 units per day, for B is 50 units per day, and for C is 150 units per day. A is produced and transported in containers that can hold up to 2 units, but B and C are transported individually. There is no setup time when switching between the three products. Assuming that the replenishment lead time is 2 days for each product, determine the number of kanbans needed for each product. (10pts) [ProductAKanbans] [ProductBKanbans] [ProductCKanbans]

What is the most common planning horizon (time scale) for a workstation control hierarchy?

Q6) Please show your work in the file submission to receive partial credit. When determining each job sequence, show the Gantt Chart. 5 pencil jobs are to be scheduled on 2 machines. Each pencil job must first pass-through Machine A before Machine B. Minimize the makespan. A1) The Pencil Job Sequence is [PencilJobSequence]. (10pts) A2) The Pencil Job Makespan is [PencilJobMakespan]. (5pts) A3) The Pencil Job Idle Time is [PencilJobIdleTime]. (5pts) Job Machine A (hours) Machine B (hours) NE 4 9 IS 6 3 NO 2 7 AT 11 5 TH 10 8 5 eraser jobs are waiting to be processed as shown below. Minimize the average completion time (i.e., minimize the mean flow time). B1) The Eraser Job Sequence is [EraserJobSequence]. (10pts) B2) The Eraser Job Number of Tardy Jobs is [EraserJobNumberOfTardyJobs]. (5pts) B3) The Eraser Job Maximum Tardiness is [EraserJobMaximumTardiness]. (5pts) Job Processing Time (days) Due Date (days) E 33 29 AR 31 43 AH 3 31 AR 4 30 DW 13 59 5 pen jobs are waiting to be processed as shown below. Minimize the maximum lateness (i.e., minimize the maximum tardiness). C1) The Pen Job Sequence is [PenJobSequence]. (10pts) C2) The Pen Job Number of Tardy Jobs is [PenJobNumberOfTardyJobs]. (5pts) C3) The Pen Job Maximum Tardiness is [PenJobMaximumTardiness]. (5pts) Job Processing Time (days) Due Date (days) S 4 37 S 3 38 I 33 36 E 13 100 U 31 66   Q7) (+3pts extra credit) What is the code to the cipher below? Please enter the letters with no spaces or dashes. No partial credit will be awarded on this problem (it is “all or nothing”). Cipher: How many software engineers does it take to change a lightbulb? Code: (string together the job sequences you found in parts A1, B1, and C1) [Code].

Q6) Please show your work in the file submission to receive partial credit. When determining each job sequence, show the Gantt Chart. 5 pencil jobs are to be scheduled on 2 machines. Each pencil job must first pass-through Machine A before Machine B. Minimize the makespan. A1) The Pencil Job Sequence is [PencilJobSequence]. (10pts) A2) The Pencil Job Makespan is [PencilJobMakespan]. (5pts) A3) The Pencil Job Idle Time is [PencilJobIdleTime]. (5pts) Job Machine A (hours) Machine B (hours) D 5 2 H 1 6 H 9 7 E 3 8 A 10 4 5 eraser jobs are waiting to be processed as shown below. Minimize the average completion time (i.e., minimize the mean flow time). B1) The Eraser Job Sequence is [EraserJobSequence]. (10pts) B2) The Eraser Job Number of Tardy Jobs is [EraserJobNumberOfTardyJobs]. (5pts) B3) The Eraser Job Maximum Tardiness is [EraserJobMaximumTardiness]. (5pts) Job Processing Time (days) Due Date (days) R 11 61 E 29 45 A 31 31 A 1 33 B 2 32 5 pen jobs are waiting to be processed as shown below. Minimize the maximum lateness (i.e., minimize the maximum tardiness). C1) The Pen Job Sequence is [PenJobSequence]. (10pts) C2) The Pen Job Number of Tardy Jobs is [PenJobNumberOfTardyJobs]. (5pts) C3) The Pen Job Maximum Tardiness is [PenJobMaximumTardiness]. (5pts) Job Processing Time (days) Due Date (days) N 11 61 W 29 45 K 31 31 O 1 33 D 2 32   Q7) (+3pts extra credit) What is the code to the cipher below? Please enter the letters with no spaces or dashes. No partial credit will be awarded on this problem (it is “all or nothing”). Cipher: Why was the manufacturing engineer so upset after fixing a malfunctioning machine? Code: (string together the job sequences you found in parts A1, B1, and C1) [Code].

Q6) Please show your work in the file submission to receive partial credit. When determining each job sequence, show the Gantt Chart. 5 pencil jobs are to be scheduled on 2 machines. Each pencil job must first pass-through Machine A before Machine B. Minimize the makespan. A1) The Pencil Job Sequence is [PencilJobSequence]. (10pts) A2) The Pencil Job Makespan is [PencilJobMakespan]. (5pts) A3) The Pencil Job Idle Time is [PencilJobIdleTime]. (5pts) Job Machine A (hours) Machine B (hours) A 5 9 I 6 3 H 2 7 H 12 5 S 11 8 5 eraser jobs are waiting to be processed as shown below. Minimize the average completion time (i.e., minimize the mean flow time). B1) The Eraser Job Sequence is [EraserJobSequence]. (10pts) B2) The Eraser Job Number of Tardy Jobs is [EraserJobNumberOfTardyJobs]. (5pts) B3) The Eraser Job Maximum Tardiness is [EraserJobMaximumTardiness]. (5pts) Job Processing Time (days) Due Date (days) I 33 29 H 31 43 N 3 31 G 4 30 T 13 59 5 pen jobs are waiting to be processed as shown below. Minimize the maximum lateness (i.e., minimize the maximum tardiness). C1) The Pen Job Sequence is [PenJobSequence]. (10pts) C2) The Pen Job Number of Tardy Jobs is [PenJobNumberOfTardyJobs]. (5pts) C3) The Pen Job Maximum Tardiness is [PenJobMaximumTardiness]. (5pts) Job Processing Time (days) Due Date (days) G 2 32 T 11 61 SO 1 33 N 31 31 U 29 45 Q7) (+3pts extra credit) What is the code to the cipher below? Please enter the letters with no spaces or dashes. No partial credit will be awarded on this problem (it is “all or nothing”). Cipher: What do all software engineers have a knack for? Code: (string together the job sequences you found in parts A1, B1, and C1) [Code].

True/False.  Enter T or F for statement.  (Do not enter the words “true” or “false”.  Just the capital letter T or F)[1] Passive components are always linear. [2] silicon atoms forms ionic bonds to create a diamond lattice. [3] Valance holes move through the silicon lattice harder than conduction electrons. [4] Band diagrams are more quantitative than chemical bond models. [5] An ‘electron volt’ is a tiny unit of voltage.   [6] The brightness of an LED corresponds with the amount of current flowing through it. [7] N-channel MOSFETs require positive VGS to turn on. [8] A solar panel is essentially an array of photoresistors. [9] Biasing a PN junction changes the bandgap of the semiconductor. [10] Applying forward bias to PN junction increases the width of the depletion region.

In Act II, what does Laertes ask of the king?  

Which of the following words best describes how Hamlet feels toward Claudius, the king?