Using Johnson's rule for 2-machine scheduling, the sequence is:Scheduled Order1JobSix jobs are to be processed through a two-step operation.The first operation involves sanding, and the second involvespainting. Processing times are as follows:JobOperation1 (hours)A12Operation2 (hours)4BCDE9F3FOT8560311142101

Answered: Image /qna-images/answer/961f5199-e632-4257-af8c-e72ae9faab09.jpg

Answered: Using Johnson's rule for 2-machine…

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 Hickory Company manufactures wooden desks. Manage-ment schedules overtime every weekend to reduce the backlogon the most popular models. The automatic routing machineis used to cut certain types of edges on the desktops. The fol-lowing orders need to be scheduled for the routing machine: The due dates reflect the need for the order to be at its nextoperation.a. Develop separate schedules by using the FCFS and EDDrules. Compare the schedules on the basis of average flowtime and average past due hours.b. Comment on the performance of the two rules relative tothese measures
Given a set ?? = {??1,??2, … ,????} of tasks, where ???? requires ???? units of processing time to finish onceit has started. There is only one computer to run these tasks one at a time. The time before a task ????starts is called its waiting time ????. The goal is come up with a schedule to minimize the overallwaiting time ∑ ???? ????=1 .(1) Give an example to show the greedy choice property and the optimal substructure in thisproblem,(2) Design a greedy algorithm to solve this problem,(3) Analyze the complexity of your algorithm.
Using the FCFS rule for scheduling, the sequence is Sunny Park Tailors has been asked to make three different types of wedding suits for separate customers. The table below highlights the time taken in hours for cutting and sewing (process 1) and delivery (process 2) of each of the suits Times Taken for Different Activities (hours) Cut and Sew Suit 1 2 3 7 4 5 Deliver 2 3 6 Assume that orders for suits have been listed in the above table in the order in which they were received. C
At an auto shop, six jobs are currently in queue. Job A B C D E F Arrival order 1 2 3 4 5 6 Processing time (minutes) 33 27 36 28 21 23 Using the shortest processing time scheduling approach, what is the average inventory of jobs in the system? Assume that processing of jobs will start immediately. Note: Round your answer to 2 decimal places.
Using the FCFS rule for scheduling, the sequence is 1-2-3 3-2-1 1-3-2 2-1-3 2-3-1 3-1-2 Sunny Park Tailors has been asked to make three different types of wedding suits for separate customers. The table below highlights the time taken in hours for cutting and sewing (process 1) and delivery (process 2) of each of the suits. Times Taken for Different Activities (hours) Suit Cut and Sew Deliver 2 2 3 4 7 6 7 5 Assume that orders for suits have been listed in the above table in the order in which they were received.
A furniture factory makes two types of wooden tables,large and small. See the flowchart below .Small tables are made in batches of 100, and large tables are made in batches of 50. A batch includes a fixed setup time for the entire batch at each process step and a run time for each piece in the batch. Both large and small tables have the same processing times. The capacities of each process step are given, and apply to production of either type of table, as shown in the flowchart. a. What is the capacity of the system, and what is thebottleneck? b. What are the throughput times for batches of large and small tables? c. When producing at a rate of six small tables per hour on average, how many tables will be in the system?
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.
The objectives of scheduling include all of the following except: A. Increased inventories in order to maximize profits. B. The ability to balance conflicting goals. C. Effective use of facilities, labor, and equipment. D. Costs are minimized by reducing waiting times, work-in-process, and other processing costs related to inventories
The single machine-scheduling problem consists of: Select one: None is correct n jobs with the same single operation on each of the jobs. n jobs with m operations on each of the jobs. n jobs with different operations on each of the jobs.
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 150 units per day. The product requires 7 tasks in total. These tasks are namely, A, B, C, D, E, F, and Grespectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed. Starting tasks Cneeds, 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 G are 2.3, 2.1, 0.9, 1.0, 1.2, 1.8, and 1.5 minutes respectively. Applying the most remaining tasks rule for balancing the assembly line, with ties broken according to longest task time first, the tasks that will be assigned to the LAST workstation are O a. All tasks O b. Gonly…
Your team has been assigned to complete 10 client projects over the next two months. These projects and their processing times (time taken to complete a project once started, in days) are described in the table below. In addition, each project has a due-date that has been set by your internal marketing team so that the customers will be delighted with your service if you complete the project by the due-date. However, your team has only enough resources to pursue exactly one project at any given time. Once started, a project is worked through its completion and is not interrupted. As a result of the sequence in which you choose to handle projects, each project will either be on time, or late if it is completed past the due date. If a project is late, the amount of time by which it misses its due-date is called its tardiness. The objective is to pick the sequence in which to complete the projects so as to minimize the total tardiness in the schedule. What is the minimum total tardiness…
A book binder has one printing press, one binding machine and manuscripts of 7 different books. The times required for performing printing and binding operations for different books are shown below. Book 1 2 3 4 5 6 7 Printing time (hours) 20 90 80 20 120 15 65 Binding time (hours) 25 60 75 30 90 35 50 Decide the optimum sequence of processing of books in order to minimize the total time required to bring out all the books.

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