Practical Management Science, Loose-leaf Version
5th Edition
ISBN: 9781305631540
Author: WINSTON, Wayne L.; Albright, S. Christian
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 5, Problem 70P
a)
Summary Introduction
To determine: The assignments that minimize the total time to complete all jobs.
Introduction: In linear programming, the unbounded solution would occur when the objective function is infinite. If no solution satisfied the constraints, then it is said to be unfeasible solution.
b)
Summary Introduction
To determine: The time to complete all jobs.
Introduction: In linear programming, the unbounded solution would occur when the objective function is infinite. If no solution satisfied the constraints then it is said to be unfeasible solution.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
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…
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…
Chapter 5 Solutions
Practical Management Science, Loose-leaf Version
Ch. 5.2 - Prob. 1PCh. 5.2 - Prob. 2PCh. 5.2 - Prob. 3PCh. 5.2 - Prob. 4PCh. 5.2 - Prob. 5PCh. 5.2 - Prob. 6PCh. 5.2 - Prob. 7PCh. 5.2 - Prob. 8PCh. 5.2 - Prob. 9PCh. 5.3 - Prob. 10P
Ch. 5.3 - Prob. 11PCh. 5.3 - Prob. 12PCh. 5.3 - Prob. 13PCh. 5.3 - Prob. 14PCh. 5.3 - Prob. 15PCh. 5.3 - Prob. 16PCh. 5.3 - Prob. 17PCh. 5.3 - Prob. 18PCh. 5.4 - Prob. 19PCh. 5.4 - Prob. 20PCh. 5.4 - Prob. 21PCh. 5.4 - Prob. 22PCh. 5.4 - Prob. 23PCh. 5.4 - Prob. 24PCh. 5.4 - Prob. 25PCh. 5.4 - Prob. 26PCh. 5.4 - Prob. 27PCh. 5.4 - Prob. 28PCh. 5.4 - Prob. 29PCh. 5.5 - Prob. 30PCh. 5.5 - Prob. 31PCh. 5.5 - Prob. 32PCh. 5.5 - Prob. 33PCh. 5.5 - Prob. 34PCh. 5.5 - Prob. 35PCh. 5.5 - Prob. 36PCh. 5.5 - Prob. 37PCh. 5.5 - Prob. 38PCh. 5 - Prob. 42PCh. 5 - Prob. 43PCh. 5 - Prob. 44PCh. 5 - Prob. 45PCh. 5 - Prob. 46PCh. 5 - Prob. 47PCh. 5 - Prob. 48PCh. 5 - Prob. 49PCh. 5 - Prob. 50PCh. 5 - Prob. 51PCh. 5 - Prob. 52PCh. 5 - Prob. 53PCh. 5 - Prob. 54PCh. 5 - Prob. 55PCh. 5 - Prob. 56PCh. 5 - Prob. 57PCh. 5 - Prob. 58PCh. 5 - Prob. 59PCh. 5 - Prob. 60PCh. 5 - Prob. 61PCh. 5 - Prob. 62PCh. 5 - Prob. 63PCh. 5 - Prob. 64PCh. 5 - Prob. 65PCh. 5 - Prob. 66PCh. 5 - Prob. 67PCh. 5 - Prob. 68PCh. 5 - Prob. 69PCh. 5 - Prob. 70PCh. 5 - Prob. 71PCh. 5 - Prob. 72PCh. 5 - Prob. 73PCh. 5 - Prob. 74PCh. 5 - Prob. 75PCh. 5 - Prob. 76PCh. 5 - Prob. 77PCh. 5 - Prob. 80PCh. 5 - Prob. 81PCh. 5 - Prob. 82PCh. 5 - Prob. 83PCh. 5 - Prob. 85PCh. 5 - Prob. 86PCh. 5 - Prob. 87PCh. 5 - 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
- Mr. Elf owns a show store. Currently, he has 10 pairs of shoes that require resoling and polishing. He has a machine that can resole one pair of shoes at a time, and the time required for the operation varies with the type and condition of the shoe and the type of sole that is used. Shoes are polished on a machine dedicated to this purpose as well, and polishing is always done after resoling. His assistant generally does the polishing while Mr. Elf does the resoling. The resoling and polishing times (in minutes) are: Shoes 1 Resoling Time 14 Polishing Time 3 2 28 1 3 12 2 4 6 5 5 10 10 6 14 6 7 4 12 8 25 8 9 10 15 10 5 5 Determine the sequence in which these shoes should be repaired to minimize the total makespan for these 10 jobs, and answer the following questions. Based on the optimal sequence: (Enter integer only) 1. The first job to be processed is Job 2. The third job to be processed is Job 3. The fourth job to be processed is Job 4. The fifth job to be processed is Job 5. The…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_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_forward
- Please walk me step by step to help solve thisarrow_forwardPlease do not give solution in image format thankuarrow_forwardAn electronic gadgets store requires the following minimum number of employees, each of whom is required to have two consecutive days off. What is the schedule for employee 1? Mon. Tue. wed. Thur. Fri. Sat. Sun. Day: Minimum employees required: 9 2 7 6 9 a) Saturday and Sunday off b) Saturday and Tuesday off c) Wednesday and Thursday off d) Tuesday and Wednesday offarrow_forward
- These are other parts of the same questionarrow_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_forwardminutes, 16 seconds. stion Completion Status: A Moving to another question will save this response. stion 7 To meet the actionable criterion of useful market segments, it must be possible to formulate effective programs for attracting and serving the segments. O True False DA Moving to another question will save this response. hparrow_forward
- 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.arrow_forwardYou are the project manager for a construction project (maybe capstone design) and you must schedule the various jobs which must be completed before the project is finished. Some of the jobs can begin immediately but other jobs can only begin after others are completed. For example, grading can begin immediately but laying a foundation must be delayed until the grading is completed. The data below are for a project which includes ten jobs; the time it takes to complete each job is known and the set of jobs which must be completed before each job can begin is known. Your objective is to find a schedule (i.e. beginning times and ending times) for all of the jobs such that no jobs begins before any of its predecessors are completed and the time when all jobs are finished is minimized. Formulate a linear programming model to solve the problem. For the following problem, formulate the Linear program or LP as follows: 1) Define the decision variables and briefly explain the significance of…arrow_forwardBE 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_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,