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. a. Determine a sequence that will minimize makespan time. The sequence is _______ (A,B,C,D,E,F,G,H); (B,A,C,D,E,F,G,H); OR (E,B,G,H,D,C,A,F) b. Find machine B's idle time. Idle Time_Hrs. c. 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? New idle time hrs,_ savings of hrs.__ Job a b C d e f 6 b TIME (hours) Machine A 16 3 9 8 2 12 18 20 Machine B 5 13 6 7 14 4 14 11

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. a. Determine a sequence that will minimize makespan time. The sequence is _______ (A,B,C,D,E,F,G,H); (B,A,C,D,E,F,G,H); OR (E,B,G,H,D,C,A,F) b. Find machine B's idle time. Idle Time_Hrs. c. 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? New idle time hrs,_ savings of hrs.__ Job a b C d e f 6 b TIME (hours) Machine A 16 3 9 8 2 12 18 20 Machine B 5 13 6 7 14 4 14 11

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

The constraints governing the jobs are as fo1lows: A and B are start jobs; A controls C, D and E; B controls F and J; G depends upon C; H depends on D; E and F control I and L; K follows J; L is also controlled by K; G, H, I and L are the last jobs. Draw the network,
The following six jobs are to be scheduled on a single machine: Job 1 2 3 4 5 6 Processing time (min.) 110 120 220 90 180 80 Suppose the jobs are processed in FCFS numerical order. Compute the makespan, flow time for each job, and overall average flow time. Round your answers to the nearest whole number. Job Flow Time (min) 1 2 3 4 5 6 Makespan: minutes Average flow time: minutes In what order would the jobs be processed using the SPT rule? The SPT sequence is - - - - - . Compute the average flow time after each job is completed. Round your answer to the nearest whole number. Average flow time: minutes Compare this answer with your answer to part a. The minimizes flow time and gets the most work done in the least amount of time.
Consider the following tasks that must be assigned to four workers on a conveyor-paced assembly line (i.e., a machine-paced line flow). Each worker must perform at least one task. There exists unlimited demand unless stated otherwise. Time to Complete Task (seconds): Task 1: 30 Task 2: 25 Task 3: 15 Task 4: 20 Task 5: 15 Task 6: 20 Task 7: 50 Task 8: 15 Task 9: 20 Task 10: 25 Task 11: 15 Task 12: 20 The current conveyor-paced assembly-line configuration assigns the workers in the following way: • Worker 1: Tasks 1, 2, 3 • Worker 2: Tasks 4, 5, 6 • Worker 3: Tasks 7, 8, 9 • Worker 4: Tasks 10, 11, 12 What is the direct labor content (in seconds per unit)?
Dan's Auto Detailing business performs two major activities: exterior cleanup and interior detailing. Based on the size of car and condition, time estimates for six cars on Monday morning are as shown in the accompanying table. Car Number 1 5 6 Exterior Interior 55 75 4 65 35 50 60 45 90 35 40 a. Sequence the cars so that all exterior cleanup is done first and total completion time is minimized. The sequence is -Select-- -Select- -Select- -Select- -Select-- -Select- 2 3 80 20
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
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).
There are five jobs (namely 1,2,3,4 and 5), each of which must go through machines A, B and C in the order ABC. Processing Time (in hours) are given below: Jobs 1 2 3 4 Machine A 5 9. Machine B 2 1 4 Machine C 3 7 7 Find the sequence that minimizes the total elapsed time required to complete .the jobs The idle time for each :machine is shown below
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
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
An independent accountant is planning to prepare tax returns for six of her clients.Prior to her actually preparing each return, her secretary checks the client’s file to besure all the necessary documentation is there and obtains all the tax forms needed forthe preparation of the return. Based on past experience with the clients, her secretaryestimates that the following times (in hours) are required for preparation of the returnand for the accountant to complete the necessary paperwork prior to filing each return:Client Secretary Time Accountant Time1 1.2 2.52 1.6 4.53 2.0 2.04 1.5 6.05 3.1 5.06 0.5 1.5In what order should the work be completed in order to minimize the total timerequired for all six clients?
Joe's Twenty-four Seven Laundromat has the following jobs waiting to be processed. The first step of the process includes washing and drying the clothes; the second step is pressing the clothing. Joe wants to minimize the amount of time it takes to do all the jobs. The five jobs waiting to be processed are shown here. Job Wash andDry (hours) Press(hours) A 5 4 B 3 4 C 2 3 D 7 5 E 4 2 Wash and Dry Using FCFS, assume the jobs arrive in the order shown (A, then B, then C, etc.). Show the beginning time for each job and ending time for the whole process adding hours throughout the process. A -0 number of hours B-5 number of hours C-8 number of hours D-10 number of hours E-17 number of hours A B C D E 0 enter a number of hours enter a number of hours enter a number of hours enter a number of hours enter a number of hours enter a number of hours Press
There are 6 jobs which go through two machines A and B in the order A-B. Processing time in hours) is given here. Determine the optimal sequence of processing the jobs and total minimum elapsed time. Find the idle time on machine B. Job 1 2 3 5 6 Machine A 8 10 11 12 16 20 Machine B 7 15 10 14 13 9