In a school, there are four teachers X1,X2,X3,X4 and five batches Y1,Y2,Y3,Y4,Y5. Given thatteacher Xi is required to teach batch Yj for Pij periods, schedule a complete routine in the minimumpossible number of periods. The matrix is given below:X1X2 X3 X4Y1 22----Y21Y3----Y4 | 121--Y511----Remember there are only 3 class rooms available.

The given question is of an unbalanced minimization problem of assignment. In order to slove the…

Answered: In a school, there are four teachers…

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

Jobs A, B, E, F and G must go through Machines M1 and M2 in that sequence. Use Johnson’s Rule to determine the optimal sequence in which to schedule the jobs to minimise the total required time. How much total time is required to process all the seven jobs? Illustrate this using a Gant Chart. Job Processing time on M1 Processing time on M2 A 4 5 B 16 14 C 8 7 D 12 13 E 3 9 F 9 6 G 8 5
Thomas has four assignments due in class tomorrow, and his class times are as follows. Class Time Marketing 304 8 am OM 385 10 am Finance 216 2 pm Psychology 4:30 pm Each class lasts one hour, and Thomas has no other classes. It is now midnight, and Thomas estimates that the marketing, OM, finance, and psychology assignments will take him six, three, four, and two hours, respectively. Use the Excel Sequencing template to determine how he should schedule the work. Can he complete all of it on time? (Hint: Using SPT and EDD. First, convert times to due dates past midnight).
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).
Currently a company that designs Web sites has six customers in its backlog. The time since the order arrived, processing time, and promised due dates are given in the following table. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 6 18 48 B 4 22 52 C 1 30 70 D 10 14 28 E 7 12 56 F 5 20 62 Develop a schedule by using the first-come, first-served (FCFS) rule and calculate the average flow time and average days past due for the schedule. Develop a schedule by using the earliest due date (EDD) rule and calculate the average flow time and average days past due for the schedule. Comment on the performance of the FCFS and EDD rules relative to average flow time and average days past due.
A manufacturer is designing a product layout for a new product production. It plans to use a production line for 8 hours per day in order to meet forecasted demand of 80 units per day. The product requires 7 tasks in total. These tasks are namely, A, B, C, D, E, F, and respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed. Starting tasks C needs, the task B to be completed. Also, starting task D needed task B to be completed. Task E can only start upon completion of Task C. Whereas starting task F needs the completion of both the tasks D and E. Finally, starting task G needed, task F to be completed. The processing times for tasks, A, B, C, D, E, F, and Gare 2.8, 2.1,0.9, 1.0, 1.2, 1.8, are 4.7 minutes respectively. How many minimum numbers of workstations are needed? Select one: a. None is the correct answer b. 5 C. 6 d. 3 e. 1
in an assignment problem involving 8 workers and 8 jobs, total number of assignments possible are a. 8 b. 16 c. 24 d. 64
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
A mortgage service office has the following four activities involved in approving a loan application. Note that a working day is 8 hours and there are 60 minutes in one hour. Activity Time (minutes) A. Property survey 24 B. Credit report 19 C. Title search 18 D. Final decision 20 The office has three employees, activities A, B and C are combined together and assigned to two employees, while the other employee is responsible for the last activity D. Under this setting, what would be the maximum number of loan applications the office can process per day? Numbers only, keep three decimals if not exact, either round up or down is ok
Five sorority sisters plan to attend a social function. Each requires hair styling andfitting for a gown. Assume that the times required are independent exponentiallydistributed random variables with the mean times for the fittings of 0.6, 1.2, 1.5,0.8, and 1.1 hours, respectively, and mean times for the stylings of 0.8, 1.6, 1.0,0.7, and 1.3 hours, respectively. Assume that the fittings are done before thestylings and that there is only a single hair stylist and a single seamstress available.In what sequence should they be scheduled in order to minimize the total expectedtime required for fittings and stylings?
Currently a company that designs Web sites has five customers in its backlog. The time since the order arrived, processing time, and promised due dates are given in the following table. The customers are ready to be scheduled today, which is the start of day 190. Customer Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) Upper AA 6 18 66 Upper BB 3 24 58 Upper CC 2 32 100 Upper DD 10 22 26 Upper EE 8 12 50 a. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average days past due. Part 2 Using the FCFS (first come, first served) decision rule for sequencing the customers, the order is: Sequence 1 2 3 4 5 Customer D E A B C Part 3 Using…
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

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

Purchasing and Supply Chain Management

Operations Management

ISBN:

9781285869681

Author:

Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson

Publisher:

Cengage Learning

Production and Operations Analysis, Seventh Editi…

Operations Management

ISBN:

9781478623069

Author:

Steven Nahmias, Tava Lennon Olsen

Publisher:

Waveland Press, Inc.

SEE MORE TEXTBOOKS