ZuoTi.Pro
Question

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 2, etc.), and FIFO systems of scheduling and processing the jobs is used. What is the completion time of each job and what is the total throughput time (makespan) of all jobs? (5 points) b. Suppose the inter-arrival times between jobs can be treated as zero and John sons rule is used to sequence and process the jobs, what is the tme of each job and what is the total throughput time (makespan) of all jobs? (7 points) c. What would be the difference in the average time a job spends in the shop in (a) and (b) above? (3 points)

business   Operations-Management   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Solution :

Activi Machine A Machine B 1 2 345 6 7 9 8 510 68 5 6 57 9 12 11 4 Activi Machine A Machine B 1 2 345 6 7 9 8 510 68 5 6 57 9 12 11 4 Schedule as per FIFO Rule Job Machine A Schedule as per Johnson Rule Job Machine A 3 5641 2 7 Start 0 9 1722 32 38 46 9 1722 32 38 46 51 Start 0 5 11 19 29 38 46 5 11 19 29 38 46 51 End End Machine B Machine B Start 9 1722 32 38 50 61 15 22 2938 50 61 65 9 203 0 0 0 Start 5 12 24 32 4147 52 12 24 3241 47 52 56 5 0 00 0 0 0 End End Idle Time at MachineB Idle Time at MachineB Average Time in System 40 Average Time in System 37.7

0 0
Add a comment
Know the answer?
Add Answer to:
3. Consider the following seven-job problem. Each job must be processed by two ma chines A...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

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

  • Problem 2 (6 points): Refer to the following data for jobs waiting to be processed at...

    Problem 2 (6 points): Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): Job Processing Time (Days) Due Date (days from Now) A 2 2 B 5 6 C 6 10 D 9 6 E 4 8 What is the average flow time for the shortest processing time (SPT) rule schedule?

  • 1. Suppose you have four jobs that must be processed, with the following table giving their...

    1. Suppose you have four jobs that must be processed, with the following table giving their charac- teristics(all times in hours): Each job can be processed on any of three identical machines; to be Job 1 23 4 Processing time 21.524 | 2 | 0 | 0.5 | 1 Release time Processing time 5346 finished, a job must be processed for its entire processing time, but this processing time can be interrupted and even moved to a different machine if...

  • A local welding shop has the following jobs to schedule. Each job needs cleaning first for...

    A local welding shop has the following jobs to schedule. Each job needs cleaning first for performing welding . How much will be total makespan time. ( Use Johnson's scheduling rule) Job Cleaning (Hours) Welding( Hours) Job Cleaning Welding a 3 1 b 5 5 c 2 6 answers: A.12 B. 11 C.14 D.15

  • 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,...

  • Consider a production line with three single-machine stations in series. Each has processing times with mean...

    Consider a production line with three single-machine stations in series. Each has processing times with mean two hours and standard deviation of two hours. a. Suppose we run this line as a push system and release jobs into it at a rate of 0.45 per hour with arrival variability given by Ca = 1. What is the average WIP in the line? b. Compute the throughput of this line if it is run as a CONWIP line with a WIP...

  • 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...

  • (a) Allan's job shop takes order for making spare parts for textile manufacturing equipment. The operation...

    (a) Allan's job shop takes order for making spare parts for textile manufacturing equipment. The operation milling and involves first milling and then finishing. Table Q4(a) presents the data of processing times for each job. (i) Determine the sequencing rule using First Come First Serve (FCFS) and Johnson's Rule. (4 marks) (ii) Make a work schedule on a Gantt chart using FCFS rules indicating the makespan. (6 marks) (iii) Make a work schedule on a Gantt chart using Johnson's rules...

  • 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...

  • 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...

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