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 sequence of the jobs will be as below=
C, B, A
Job | In | Out | In | Out |
C | 0 | 2 | 2 | 8 |
B | 2 | 7 | 8 | 13 |
A | 7 | 10 | 13 | 14 |
So the total makespan time =14
So the correct answer=14
A local welding shop has the following jobs to schedule. Each job needs cleaning first for...
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 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...
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...
Question 2 3 pts Per Johnson's rule - If a job has to go through two machines: First for 3 hours on Welding and then 4 hours on Painting - and if the 3 hours was the shortest processing time of all jobs going through these operations, I would: Schedule this job as late as possible Schedule this job as early as possible
2. Determine the processing sequence for the six jobs shown below using Johnson's Rule. (A) Calculate total throughput (makespan) time. (12 pts) (B) Can the makespan be reduced by splitting the latest job? If so, by how much? (8 pts) Working Working Center 1 Center 2 Job 6 8 c 10 900 Resolution 20p HD-Ready Gateway FPD1975W TFTLCD Monitor Theft Detemce 4 8 c 10 9 e 11 7 Gateway FPD TFT LC
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...
3. The operation manager of a body and paint shop has five cars to schedule for repair. He would like to minimize throughput time to complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body and paint work on each are listed below. Car Body Work (Hours) Paint (Hours) JA 12 B 17 6 14 10 C 19 D 3 E 12 4 5 (a) Determine...
please answer this ABC's machine shop is considering the use of priority scheduling rule in the fabrication shop and must decide whether to use: a. Critical ratio (CR) Earliest due date (EDD) C. Shortest operation next (SON)/Shortest processing time 9SPT) d. Order Slack Order No. Total Remaining Time Remaining Current operation Manufacturing until Due Date Processing time Time (days) (days) (days) А 12 15 10 14 D 18 15 19 Using the four sequencing rules, compute the scheduling priority for...
Question 1: Sequence the jobs shown below by using a Gantt chart. Assume that the move time between machines is one hour. Sequence the jobs in priority order 1, 2, 3, 4. Job Work Center/Machine Hours Due Date (days) 1 A/3, B/2, C/2 3 2 C/2, A/4 2 3 B/6, A/1, C/3 4 4 C/4, A/1, B/2 3 Using finite capacity scheduling, draw a Gantt chart for the schedule (Marks 0.5) What is the makespan? (Marks 0.5) How much machine...
3. The operation manager of a body and paint shop has five cars to schedule for repair. He would like to minimize throughput time to complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body and paint work on each are listed below. Car А B с D E Body Work (Hours) 12 7 9 3 12 Paint (Hours) 6 4 10 4 5 (a) Determine...