##Proc. time at ##Proc. time at Work Center 2 Job Work Center 1 A B C D E (hours) 15 16 5 9 4 (hours) 13 18 8 14 5 There are Five manufacturing jobs that need to be processed through two work centers - a drill and a lathe machine - at a tool and die shop. The processing time for each job is provided in the table. Your task is to determine the optimal sequence that minimizes the total completion time for this group of jobs. Which job is ranked 2nd in this sequence?

##Proc. time at ##Proc. time at Work Center 2 Job Work Center 1 A B C D E (hours) 15 16 5 9 4 (hours) 13 18 8 14 5 There are Five manufacturing jobs that need to be processed through two work centers - a drill and a lathe machine - at a tool and die shop. The processing time for each job is provided in the table. Your task is to determine the optimal sequence that minimizes the total completion time for this group of jobs. Which job is ranked 2nd in this sequence?

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

Use the S/O rule to schedule the following jobs. Note that processing time includes the timeremaining for the current and subsequent operations. In addition, you will need to know thenumber of operations remaining, including the current one.JobRemainingProcessingTimeDueDateRemainingNumber ofOperationsA 4 14 3B 16 32 6C 8 8 5D 20 34 2E 10 30 4F 18 30 2
Five jobs must be scheduled for batch processing on a mainframe computer system. The processing times and the promised times for each of the jobs are listedhere.Job 1 2 3 4 5Processing time 40 min 2.5 hr 20 min 4 hr 1.5 hrPromised time 11:00 A.M. 2:00 P.M. 2:00 P.M. 1:00 P.M. 4:00 P.M.Assume that the current time is 10:00 A.M.a. If the jobs are scheduled according to SPT, find the tardiness of each job and themean tardiness of all jobs.b. Repeat the calculation in part (a) for EDD scheduling
The times required to complete each of eight jobs in a two-machine flow shop are shown in the table that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B. TIME (hours) Job Machine A Machine B a 16 5 b 3 13 c 8 7 d 9 6 e 2 14 f 14 4 g 18 14 h 20 11 Find machine B’s idle time For the sequence determined in part a, how much would machine B's idle time be reduced by splitting the last two jobs in half?
Sequencing jobs through two work centers. Use Johnson’s rule to obtain the optimum sequence for processing the jobs shown through work centers A and B.JOB TIMES (hours)Job Work Center A Work Center Ba 2.50 4.20b 3.80 1.50c 2.20 3.00d 5.80 4.00e 4.50 2.00
Given the following information on job times and due dates. Job Job Time(Hours) Due Date(Hours) a 3.5 7 b 2.0 6 c 4.5 18 d 5.0 22 e 2.5 4 f 6.0 20 a-1. Determine the optimal processing sequence using (1) First come, first served, (2) Shortest processing time, (3) Earliest due date, and (4) Critical ratio. Sequence for First come, first served Sequence for Shortest processing time Sequence for Earliest due date Sequence for Critical ratio a-2. For each method, find the average job flow time and the average job tardiness. (Round your answers to 2 decimal places.) First Come, FirstServed Shortest ProcessingTime Earliest Due Date Critical Ratio Average flow time Average job tardiness
uestion 2:ID:_________________________Three jobs are to be scheduled on two machines A and B. Assume that the jobs are processed in the sequence A-B. The processing times are: JobA1 2 35 7 3B4 7 5Draw a Gantt chart that shows the schedule corresponding to the sequence 1-2-3 of the jobs.
A shoe repair operation uses a two-step sequence that all jobs in a certain category follow. Alljobs can be split in half at both stations. For the group of jobs listed:a. Find the sequence that will minimize total completion time.b. Determine the amount of idle time for workstation B.c. What jobs are candidates for splitting? Why? If they were split, how much would idle time andmakespan time be reduced?JOB TIMES (minutes)A B C D EWorkstation A 27 18 70 26 15Workstation B 45 33 30 24 10
2. The operations manager of an assembly and paint shop has five trucks to schedule for repair. He would like to minimize the throughput time (makespan) to complete all work on these cars. Each truck requires assembly prior to painting. The estimates of the times required to do the assembly and paint work on each are as follows:Use Johnson's rule to sequence these five jobs for minimum total duration. Show your step by step work in determining the job sequence and calculate the total duration of finishing assembly and painting operations on all the five trucks ?
A computer center has two identical computers for batch processing. Thecomputers are used as parallel processors. Job times are estimated by the user, but experience has shown that an exponential distribution gives an accurate description of the actual job times. Suppose that at a point in time there are eight jobs remaining to be processed with the following expected job times (expressed in minutes):Job 1 2 3 4 5 6 7 8Expected time 4 8 1 50 1 30 20 6a. In what sequence should the jobs be processed in order to minimize theexpected completion time of all eight jobs (i.e., the makespan)?b. Assume that computer A is occupied with a job that has exactly two minutes of processing time remaining and computer B is idle. If job times are deterministic, show the start and end times of each job on each computer using the sequence derived in part (a).
The times required to complete each of eight jobs in a two-machine flow shop are shown in thetable that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B.a. Determine a sequence that will minimize makespan time.b. Construct a chart of the resulting sequence, and find machine B’s idle time. c. For the sequence determined in part a, how much would machine B’s idle time be reduced bysplitting the last two jobs in half?TIME (hours)Job Machine A Machine Ba 16 5b 3 13c 9 6d 8 7e 2 14f 12 4g 18 14h 20 11
The operations manager of a body and paint shop has five cars to schedule for repair. The estimates of the times required to do the body and paint work on each are as follows: Using Johnson's Rule to minimize total duration, the correct sequence of these five jobs is; a. DCAEB b. DBECA c. BEACD d. ACEBD Car Body Work (Hours) Paint (Hours) A 8 7 B 9 4 C 7 9 D 3 4 E 12 5
A group of six jobs is to be processed through a two-machine flow shop. The first operation involves cleaning and the second involves painting. Determine a sequence that willminimize the total completion time for this group of jobs. Processing times are as follows:PROCESSING TIME (hours)Job Work Center 1 Work Center 2A 5 5B 4 3C 8 9D 2 7E 6 8F 12 15 To employ Johnson’s rule, create a “blank” sequence first, such as:mhhe.com/stevenson13eEXAMPLE 41st 2nd 3rd 4th 5th 6th