QUESTION 4 (SCHEDULING: JOHNSON'S RULE)The following schedule was prepared by the production manager of Marymount Metal Shop:Determine a schedule that will result in the earliest completion of all jobs on this list.CUTTINGPOLISHINGJobABCDEFG(ii)(iii)(iv)Start02611151720Finish261115172021Start2615232112024Finish591320232428What is the optimal sequence?Draw the time-phased chart.What is the total completion time?What is the total idle time at Polishing work centre?

Sequencing is an appropriate order of plan as per which the process of operations works. It defines…

Answered: (i) (ii) (iii) (iv) What is the optimal…

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

Question1: Discuss the critical importance of work schedule in project management.2. Discuss the contribution of cost estimation in the completion of successful project.3. A firm is planning a project which consists of the following ten jobs and precedence relations are identified with their node numbers: Jobs (i-j) 1-2 1-3 2-3 2-4 2-5 3-5 4-7 5-6 6-7 7-8 Durations (days) 9 5 12 7 8 11 10 3 4 6 Draw an arrow diagram representing the project.b. Determine the critical pathc. What is the duration of the project?
Question Scenario: Early one Monday morning in Jamaica, Susan, a Restaurant Manager starts getting ready for the morning’s work operations. She is particularly happy because tonight he has a date with Marvin, the new Chef that was recently hired. The problem, as Susan sees it, is that Roberta, another Restaurant employee has been just a little too friendly with Marvin lately and that really upsets Susan. Susan has redone the work schedule, assigning Roberta the clean-up shift in the night and cutting back on her hours of work. She is hoping that Roberta would simply quit and out of her way. However, that plan doesn’t seem to be working. Despite a lighter pay cheque and frequent reprimand through the disciplinary process of creating reasons to write to her about her conduct and performance. Roberta has decided to quit her studies due to her inability to fund her tuition. A few days later, Susan noticed Marvin and Roberta having lunch together in the staff dining room. Susan got furious…
Question 1 (b) A company is considering to invest in eight projects. The estimated cost of each project, the perceived priority points, the estimated number of new jobs each project would create are provided in the Table 1. Table 1 Project Cost ($) Priority Points New Jobs X1 X2 X3 X4 X5 X6 X7 X8 5000 4500 600 2000 6000 800 3200 2500 3176 2774 3513 2928 4607 862 3829 2708 5 1 2 1 3 1 7 2 1. Formulate objective function for this 0-1 integer model to maximise the total number of perceived priority points. Considering the above problem write down mathematical equations for each of following conditions/constraints. 2. A budget of $21000 is available for the projects. 3. The company wishes to fund at most three of the projects. 4. The company wants to create at least 8 new jobs from these projects.…
Question 1 (b) A company is considering to invest in eight projects. The estimated cost of each project, the perceived priority points, the estimated number of new jobs each project would create are provided in the Table 1. Table 1 Project Cost ($) Priority Points New Jobs X1 X2 X3 X4 X5 X6 X7 X8 5000 4500 600 2000 6000 800 3200 2500 3176 2774 3513 2928 4607 862 3829 2708 5 1 2 1 3 1 7 2 4. The company wants to create at least 8 new jobs from these projects. 5. Only one of the two projects, i.e., X3 and X5 should be funded at this time but not both. 6. The company believes that if it decides to invest in project X7 then it should also invest in project X8, and vice versa. [DO NOT SOLVE THE ABOVE MODEL YOU DEVELOPED IN QUESTION 1 (b).…
Question 1) Scheduling If the following jobs are sequenced according to the FCFS rule Job Processing Time (days) Due Date A 8 12 B 6 15 C 11 17 D 5 10 E 3 8 What is the mean tardiness (in days) for all jobs? What is the mean completion time in days for all jobs? What is the maximum job tardiness (in days)
Question 1 Four floral arranging jobs are to be carried out across three stations: A (Arrange), B (Bag), C (crop) shown. The station sequences and job times in minutes are shown below, along with the due dates for each job. Using an "earliest due date" job dispatching priority rule, which, if any, of the jobs in will be late? Tip: create a Gantt chart schedule before answering Questions 4 & 5. a. Jobs 2 & 3 b. Jobs 3 & 4 c. Job 3 d. Job 4 e. None of the jobs will be late
Question fourThree jobs are to be scheduled on two machines A and B. Assume that the jobs are processed in the sequence A-B (A has to finish the job before B can continue the job). The processing times are: Job A B1 5 42 7 73 3 5Draw a Gantt chart that shows the schedule corresponding to the sequence 1-2-3 of the jobs.
QUESTION 5a. A Chef bakes and decorates cakes in a two-stage process. The cakes are baked and once cooledthey are then decorated based on the clients’ requirements. The Chef received seven orders forfully decorated cakes and has documented the orders with respective processing times for bakingand decorating, as shown in Table 7 that follows:.Table 7. Cake Job Orders received by the Chef with the respective processing times for Baking andDecoratingCake Job Order Baking Processing Time Decorating Processing TimeA 2 1B 8 5C 4 6D 9 7E 7 8F 9 6G 3 5 (ii) Illustrate the flow (throughput) times to complete the baking and decorating on atimeline chart.
QUESTION 5a. A Chef bakes and decorates cakes in a two-stage process. The cakes are baked and once cooledthey are then decorated based on the clients’ requirements. The Chef received seven orders forfully decorated cakes and has documented the orders with respective processing times for bakingand decorating, as shown in Table 7 that follows:.Table 7. Cake Job Orders received by the Chef with the respective processing times for Baking andDecoratingCake Job Order Baking Processing Time Decorating Processing TimeA 2 1B 8 5C 4 6D 9 7E 7 8F 9 6G 3 5 (i) Using Johnson’s Rule, determine the optimum sequence for processing the cake joborders through the baking and decorating stages.
QUESTION THREEGiven the LP below:a) Solve the problem using big M-methodMinimize Z = 3X1 +4X2s.t 4X1 + X2 ≥ 30−X1 − 4X2 ≤ −184X1 + 3X2 ≥ 28X1, X2, ≥ 0
Question 34 Consider the processing times and priorities for four jobs: Job Processing time (minutes) Weight/Priority (cost per minute) A 10 6 B 2 1 C 50 2 D 16 10 Assume the weighted shortest processing time (WSPT) rule is used. Which job should be processed third? Group of answer choices A B C D
Question 35 Consider the processing times and due dates of the following jobs: Job Processing time (days) Due date (days) 1 3 29 2 19 25 3 24 40 4 8 20 What is the average lateness if the earliest due date (EDD) is used to sequence the jobs? Group of answer choices 0.75 1.25 4.25 5.67

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

(i) (ii) (iii) (iv) What is the optimal sequence? Draw the time-phased chart. What is the total completion time? What is the total idle time at Polishing work centre?