Question: . Q3. Consider the following single machine problem. Job 1 2 3 4 150 6 Process time 8 3 4 6 5 7 Weights 6

.

Q3. Consider the following single machine problem. Job 1 2 3 4 150 6 Process time 8 3 4 6 5 7 Weights 6 3 1 4 8 5 Due date 6 10 11 12 13 14 (a) Find the optimum sequence that minimize the total weighted completion time. Then compute average weighted tardiness, average weighted completion time, and maximum tardiness. (b) Find the optimum sequence that minimize the maximum lateness. Then compute average weighted tardiness, maximum lateness, and total number of tardy jobs. (c) Find the optimum sequence that minimize the total number of tardy jobs. Then compute average weighted tardiness, total number of tardy jobs, and maximum tardiness.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!

12 Q3. Consider the following single machine problem. Job 1 2 3 4 5 6 Process time 8 3 4 6 5 7 Weights 6 3 1 4 8 5 Due date 6 10 11 13 14 (a) Find the optimum sequence that minimize the total...

Consider the following single machine scheduling problem. Job 1 2 3 4 5 6 Processing time (t1) 8 9 7 8 10 14 Due date dj 14 12 10 14 20 28 Determine the sequence which will minimize the maximum...

2) Consider a scheduling problem for two uniform parallel machines. There are 6 jobs to be processed and the processing are as follows: Job 1 2 3 4 5 6 Process time 4 6 10 8 10 14 Speeds of machines...

Q5. Consider a scheduling problem for two uniform parallel machines. There are 6 jobs to be processed and the processing are as follows: Job 1 2. 3 4 5 6 Process time 4 6 10 8 10 Speeds of machines...

(a) Describe the two dominance properties that reduce the three machine flow shop scheduling problem with makespan as the performance measure to two- machine problem. (b) Determin the minimum...

The following six Jobs are to be scheduled on a single machine: Job 1 2 3 4 5 6 Processing time 70 160 220 90 130 100 (min.) a. Suppose the jobs are processed in numerical order. Compute the average...

1. Six jobs need to be sequenced through a facility that can only process one job at a time. It is time tuo right now. The jobs are shown on the table below: Job 1 2 3 4 5 6 Processing time P; (in...

Consider the following data related to single machine job scheduling: Job 1 2 3 4 5 6 Processing Time 12 8 15 9 5 19 Due Date 30 19 15 20 23 10 where the objective of scheduling is minimize the total...

Please anser questions attached, I dont need explanations. The following six jobs are to be scheduled on a single machine: Job 1 2 3 4 5 6 Processing time (min.) 100 130 210 70 150 110 Suppose the...

The following six jobs are to be scheduled on a single machine: Job 1 2 3 4 5 6 Processing time 120 150 210 80 140 70 (min.) a. Suppose the jobs are processed in FCFS numerical order. Compute the...

Write an international business paper about the Irish economy

Q4. Write a program which will find all such numbers which are divisible by 6 but are not a multiple of 5, between 1000 and 2000 (both included).

a) Write the denary number 44 as an 8-bit binary number. b) Carry out a logical shift two places left on your binary number found in part a). Comment on your answer. c) Carry out a logical shift two...

Hi. I have a class called Employee and there are constructors as arraylists that show the projects that the are currentProjects and doneProjects(it finished) . Each employee must have at least 3...