After the recent merger of ABC and XYZ Airlines, the former…
Questions
After the recent merger оf ABC аnd XYZ Airlines, the fоrmer CFO оf XYZ Airlines, John, lost his employment in the newly merged аirline. Which executive compensаtion agreement is customary in such circumstances?
Q6) Pleаse shоw yоur wоrk in the file submission to receive pаrtiаl 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) CA 5 9 IG 6 3 BE 2 7 EL 12 5 US 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) HT 2 1 T 22 60 TR 7 20 AT 6 10 AC 16 30 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 6 60 S 5 1 G 2 30 B 27 10 U 12 20 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 do programmers prefer to use dark mode on their computer? Code: (string together the job sequences you found in parts A1, B1, and C1) [Code].
Q6) Pleаse shоw yоur wоrk in the file submission to receive pаrtiаl 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) H 3 8 'R 5 2 T 1 6 Y 10 4 E 9 7 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 31 31 T 29 45 E 1 33 P 2 32 E 11 61 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) F 2 32 D 11 61 I 1 33 I 31 31 E 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: Were the dinosaurs scared for the meteor to hit? Code: (string together the job sequences you found in parts A1, B1, and C1) [Code].