Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 8, Problem 39P
Summary Introduction
To determine: The assignments of jobs to workstation.
Introduction: The variation between the present value of the
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
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.
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 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…
Chapter 8 Solutions
Practical Management Science
Ch. 8.3 - Prob. 1PCh. 8.3 - Prob. 2PCh. 8.4 - Prob. 3PCh. 8.4 - Prob. 4PCh. 8.4 - Prob. 5PCh. 8.5 - Prob. 6PCh. 8.5 - Prob. 7PCh. 8.5 - In the lawn mower production problem in Example...Ch. 8.6 - Prob. 9PCh. 8.6 - Prob. 10P
Ch. 8.6 - Prob. 11PCh. 8.6 - Prob. 12PCh. 8.7 - Prob. 13PCh. 8.7 - Prob. 14PCh. 8.8 - Prob. 15PCh. 8.8 - Prob. 16PCh. 8.8 - Prob. 17PCh. 8.8 - Prob. 18PCh. 8.8 - Prob. 19PCh. 8 - Prob. 20PCh. 8 - Prob. 21PCh. 8 - Prob. 22PCh. 8 - Prob. 23PCh. 8 - Prob. 24PCh. 8 - Prob. 25PCh. 8 - Prob. 26PCh. 8 - Prob. 27PCh. 8 - Prob. 28PCh. 8 - Prob. 29PCh. 8 - Prob. 30PCh. 8 - Prob. 31PCh. 8 - Prob. 32PCh. 8 - Prob. 33PCh. 8 - Prob. 34PCh. 8 - Prob. 35PCh. 8 - Prob. 36PCh. 8 - Prob. 37PCh. 8 - Prob. 38PCh. 8 - Prob. 39PCh. 8 - Prob. 1CCh. 8 - Prob. 2C
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- One possible solution method for the machine-to job assignment problem is the following heuristic procedure. Assign the machine to job 1 that completes job 1 quickest. Then assign the machine to job 2 that, among all machines that still have some capacity, completes job 2 quickest. Keep going until a machine has been assigned to all jobs. Does this heuristic procedure yield the optimal solution for this problem? If it does, see whether you can change the job times so that the heuristic does not yield the optimal solution.arrow_forwardYour 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…arrow_forwardFive workers are available to perform four jobs. Thetime it takes each worker to perform each job is given inTable 65. The goal is to assign workers to jobs so as tominimize the total time required to perform the four jobs.Use the Hungarian method to solve the problem.arrow_forward
- Modify the machine-to-job assignment model under the assumption that only three of the four jobs must be completed. In other words, one of the four jobs does not have to be assigned to any machine. What is the new optimal solution?arrow_forwardEasy Moving, a moving company, is seeking outside advice from a consultant (you) about the appropriate selection measures to use to analyze job candidates. The position that the company most often hires for is a Driver/Mover. Individuals in this job must be able to drive long hours, and lift and carry heavy objects for long periods of time. When people are moving from one home to another they contact Easy Moving to take care of relocating all of their belongings. The people responsible for the move are the Drivers/Movers. Because driving a truck is an essential function of the job, individuals must not only be physically capable of driving, but also must have an impeccable driving record. Driving a truck can be considered a safety hazard if the individuals were not in the right frame of mind to be a good driver. Easy Moving should keep these things in mind when analyzing applicants. Additionally, individuals applying for a Driver/Mover position with Easy Moving must have the physical…arrow_forwardAn order for 200 units of a product is processed on work centers A and B. The set up time on A is 45 minutes and the run time is 5 minutes per piece. The set up time on B is 40 minutes and the run time is 8 minutes per piece. The wait time between the two operations is 2 hours. The move time between A and B is 15 minutes. Wait time after operation B is 1 hour and the move time into stores is 50 minutes. There is no queue at either work station. Calculate the total manufacturing lead time for the order.arrow_forward
- Amanufacturer 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 180 units per day. The product requires 7 tasks in total. These tasks are namely,. A. B, C, D, E. F.and Grespectively, TaskAdoes not have any predecessor to start. To start Task B, it requires Task Ato 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 Fneeds the completion of both the tasks Dand E. Finally, starting task Gneeded, task F to be completed. The processing times for tasks. A. B, C. D.E.F. and Gare 2.4, 22,0.9, 10, 1.2. 1.8, are 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 THIRD workstation are O a D,E.and F Ob. D.E Oc CandE Od.…arrow_forwardCodeword Codeword is a medium-size firm that designs and manufactures electronic systems for the mass transit industry. It competes with other firms to win contracts to provide such systems. When Codeword receives a contract, it creates a project to complete the work. Most projects range from $10 million to $50 million in cost and from one to three years in duration. Codeword can have 6 to 12 projects going on at any one time, in various stages of completion—some just starting and others finishing. Codeword has a handful of project managers who report to the general manager; other people report to their functional manager. For example, the electronics engineers all report to the manager of electrical engineering, who reports to the general manager. The functional manager assigns particular individuals to work on various projects. Some people work full-time on a project, whereas others split their time among two or three projects. Although individuals are assigned to work for a project…arrow_forwardDuring the annual conference of a professional organization, nine topics were proposed for simultaneous plenary discussions. However, some topics need to be scheduled in different time slots. The table summarizes which topic cannot be discussed in the same schedule. Topics 1 2 3 4 5 6. 8 9 1 2 3 X X X --- 4 X --- X X X X X X X 7 X --- X Which topic should be included in each time slot? O Time slot 1: Topics 1,5, and 6 Time slot 2: Topics 2 and 3 Time slot 3: Topics 4 and 8 Time slot 4: Topics 7 and 9 O Time slot 1: Topics 1,3,and 5 Time slot 2: Topics 2 and 3 Time slot 3: Topics 4 and 7 O Time slot 1: Topics 3,5, and 6 Time slot 2: Topics 1 and 3 Time slot 3: Topics 4 and 8 Time slot 4: Topics 6 and 9 Time slot 5: Topics 4 and 8 Time slot 6: Topics 3 and 6 O Time slot 1: Topics 1,5, and 6 Time slot 2: Topics 1 and 3 Time slot 3: Topics 4 and 5 Time slot 4: Topics 7 and 9 Time slot 5: Topics 5 and 8 5 and 8 O Time slot 1: Topics 1,4, and 6 Time slot 2: Topics 2 and 3 Time slot 3: Topics…arrow_forward
- BE Spreadsheet Mike Reynolds has four assignments due in class tomorrow, and his class times are as follows: Time 9 a.m. 12 p.m. 2 p.m. 5:30 p.m. Each class lasts one hour, and Mike has no other classes. It is now midnight, and Mike estimates that the marketing, finance, psychology, and OM assignments will take him one, four, five, and seven hours, respectively. Assume that all time till the last class begins can be spent on completing assignments but each assignment should be done till the time of the class on the same subject. (Mike can prepare assignments for the next classes during previous classes.) Use the Excel Sequencing template to determine how he should schedule the work. Use minus sign to enter negative lateness values, if any. Enter the half an hour value as 0.5, e.g., 3:30 p.m. should be entered as 15.5. If your answer is zero, enter "0". Round your answers for the due date, lateness, and tardiness to one decimal place. Round your answers for the average values to two…arrow_forwardIn project planning, one of the key scheduling functions is task scheduling. The sequence of tasks may have them put in mutual relationships according to 4 dependencies: start-to-start, finish-to-finish, start-to-finish, and finish-to-start. The latter is the most common: one task gets finished so the next starts. The next to last is the most uncommon: the next task won't finish before the first one starts. Look up definitions of all of those dependencies and bring up one example for any two of the following dependencies: start-to-start, finish-to-finish, start-to-finish. Discuss how your example is appropriate for the selected dependency. ps. This Questiong is about ''project Management" please, and thank you.arrow_forwardA department has four subordinates, and four tasks to be performed. The subordinates differ inefficiency and the tasks differ in their intrinsic difficulty. His estimate of time each man wouldtake to perform each task is given in the matrix below.Job StaffTerry Jane Tom TarilJob A 18 26 17 11Job B 13 28 14 26Job C 38 19 18 15Job D 19 26 24 10Determine how the tasks should be allocated one to one man so as to minimize the total manhoursarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
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
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.