Question



1. Suppose you have four jobs that must be processed, with the following table giving their charac- teristics(all times in ho
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Job 1: Total Processing Time: 5 hrs

Job 2: Total Processing Time: 3 hrs

Job 3: Total Processing Time: 4 hrs

Job 4: Total Processing Time: 6 hrs

Machine Times:

Machine

Processing time

Release time

1

2

2

2

1.5

0

3

2

0.5

4

4

1

Ans)

We can finish given 4 jobs in maximum of 7.5 hrs.

Time (in hrs)

Machine1

Machine2

Machine3

Machine4

0-0.5

Job 3

Job1

Job4

0.5-1

Job 3

Job1

Job4

1- 1.5

Job3

Job1

Job4

1.5-2.0

Job3

Job1

Job4

2.0-2.5

Job1

Job4

2.5-3.0

Job3

Job1

Job4

3.0-3.5

Job3

Job1

Job4

3.5-4.0

Job3

Job1

Job4

4.0-4.5

Job4

Job1

Job2

4.5-5.0

Job4

Job1

5.0-5.5

Job4

Job2

5.5-6.0

Job4

Job2

6.0-6.5

Job2

6.5-7.0

Job2

7.0-7.5

Job2

At max, we can finish the job within 7.5hours

Add a comment
Know the answer?
Add Answer to:
1. Suppose you have four jobs that must be processed, with the following table giving their...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 7. Five jobs must be scheduled. Each of the jobs must be processed on two machines...

    7. Five jobs must be scheduled. Each of the jobs must be processed on two machines (A and B) in the same order. The processing times are listed below. In what order should the jobs be processed? A 16 10 Job 1 2 3 4 5 B 2 10 4 3 2 20 12 1 A. 1-2-3-4-5 B. 3-5-2-4-1 C. 4-5-3-2-1 D. 4-1-2-3-5 E. 5-4-3-2-1

  • Question No.2: Table below provides the processing times in hours of seven jobs to be processed...

    Question No.2: Table below provides the processing times in hours of seven jobs to be processed on four machines in the order Mi-M2-M3-M4. Obtain the sequence that minimises the total processing time, calculate the minimum time taken to process these seven jobs on four machines, and calculate the minimum value of idle time for each of the machines Data on processing times in hours Job Machine MI 12 M2 MO 9 M4

  • 3. Consider the following seven-job problem. Each job must be processed by two ma chines A...

    3. Consider the following seven-job problem. Each job must be processed by two ma chines A and B, first on machine A and then machine B. The operation processing times at machine A and B are as follows: Job i 1 2 3 5 6 Processing time on machine A (a9 8 5 10 6 8 5 Processing time on machine B (b) 6 5 7912 11 4 a. Suppose jobs arrived in their natural order (i.e, job before job...

  • n 10 The following set of jobs must be processed ed serially through a two-step system....

    n 10 The following set of jobs must be processed ed serially through a two-step system. The times at out of each process are in hours. If Johnson's Rule is used to sequence the jobs then Job A would complete processing on operation 2 at Job Process Process 2 A 12 9 B 11 C 7 6 D 10 14 E 5 8 Select one: A. hour 38. LO A 12 8 11 C 7 6 D 10 14 E...

  • Suppose we have five jobs to be processed on a single machine. The processing times and...

    Suppose we have five jobs to be processed on a single machine. The processing times and the due dates of the jobs are shown below Job 2 3 4 Processing Time 2 6 5 4 Due Date 10 11 15 4 13 Find a schedule that minimizes the number of tardy jobs

  • make sure the answer is correct 100% Exercise 1: Suppose that 5 jobs will be processed...

    make sure the answer is correct 100% Exercise 1: Suppose that 5 jobs will be processed on a single machine. The jobs are ready for processing at time. The other job characteristics are as shown in the table below. Find the: Mean flow time, Average tardiness and number of tardy jobs using: a. FCFS (30 Points) b. EDD (30 Points) Job Processing Time Due Date 10 20 B 20 30 С 4 10 D 16 24 E 6 8 F...

  • Each of the jobs listed in the table below must be processed first at Work Center...

    Each of the jobs listed in the table below must be processed first at Work Center 1 and then at Work Center 2. Use Johnson's rule to determine the sequence in which to process the jobs Job WC#1 WC#2 20 A 27 40 18 23 31 25 D 35 The first job in the sequence should be The second job in the sequence should be The third job in the sequence should be The fourth job in the sequence should...

  • The input to the ThreeMachineMakespan is a set of n jobs each with a processing time...

    The input to the ThreeMachineMakespan is a set of n jobs each with a processing time . A feasible solution assigns each job to one of three machines. The sum of the processing times of the jobs assigned to a machine is the time that machine is required to run. The makespan is the maximum time any of the three machines must run​. Define a local search algorithm for ThreeMachineMakespan and run it on the instance {2, 2, 2, 4,...

  • Problem #1 Five jobs are to be processed through a single machine. The processing times and...

    Problem #1 Five jobs are to be processed through a single machine. The processing times and due dates are given here. Assume all released dates are zero. Job 1 2 3 4 5 Processing time 3 6 5 4 2 Due date 4 8 12 21 15 In each of the following cases determine the sequence in which she should perform and compute Mean Flow Time, Average Tardiness and the number of tardy jobs. A) Shortest Processing Time B) Early...

  • Six jobs are to be processed through a​ two-step operation. The first operation involves​ sanding, and...

    Six jobs are to be processed through a​ two-step operation. The first operation involves​ sanding, and the second involves painting. Processing times are as​ follows: JOB OPERATION 1 (HOURS) OPERATION 2 (HOURS) A 4 8 B 10 5 C 3 11 D 14 14 E 6 1 F 7 12 a. Using​ Johnson's rule for​ 2-machine scheduling, the sequence​ is: Scheduled Order Job 1 ? 2 ? 3 ? 4 ? 5 ? 6 ? b. For the schedule developed...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT