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.8, Problem 15P
Summary Introduction
To determine: The optimal sequencing of jobs using evolutionary solver.
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
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?
Consider a manufacturing process depicted by the following flowchart.
A1
B: 4 minutes
A2
A3
B
Either of C1 and C2: 2 minutes.
C1
Station A has 3 parallel operators, A1, A2, and A3. Station C has 2 parallel operators,
C1 and C2. Each unit only needs to be processed by one of the operators A1, A2 and
A3. After being processed at Station B, a unit then needs to be processed by either
C1 or C2. The process time of the individual operators are given as follows.
Each of A1, A2, and A3: 20 minutes
C2
What is the capacity (in units/hour) of the whole process? Round your final answer
to 2 decimal places if it is not a whole number.
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…
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
- 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_forwardI need a b c pleasearrow_forwardJoe's Twenty-four Seven Laundromat has the following jobs waiting to be processed. The first step of the process includes washing and drying the clothes; the second step is pressing the clothing. Joe wants to minimize the amount of time it takes to do all the jobs. The five jobs waiting to be processed are shown here. Job Wash andDry (hours) Press(hours) A 5 4 B 3 4 C 2 3 D 7 5 E 4 2 Wash and Dry Using FCFS, assume the jobs arrive in the order shown (A, then B, then C, etc.). Show the beginning time for each job and ending time for the whole process adding hours throughout the process. A -0 number of hours B-5 number of hours C-8 number of hours D-10 number of hours E-17 number of hours A B C D E 0 enter a number of hours enter a number of hours enter a number of hours enter a number of hours enter a number of hours enter a number of hours Pressarrow_forward
- Consider the following tasks that must be assigned to four workers on a conveyor-paced assembly line (i.e., a machine-paced line flow). Each worker must perform at least one task. There exists unlimited demand unless stated otherwise. Time to Complete Task (seconds): Task 1: 30 Task 2: 25 Task 3: 15 Task 4: 20 Task 5: 15 Task 6: 20 Task 7: 50 Task 8: 15 Task 9: 20 Task 10: 25 Task 11: 15 Task 12: 20 The current conveyor-paced assembly-line configuration assigns the workers in the following way: • Worker 1: Tasks 1, 2, 3 • Worker 2: Tasks 4, 5, 6 • Worker 3: Tasks 7, 8, 9 • Worker 4: Tasks 10, 11, 12 What is the direct labor content (in seconds per unit)?arrow_forwardOne possible solution method for the machine-tojob 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_forwardOne 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_forward
- At the campus copy shop, six jobs have arrived in the order shown (A, B, C, D, E, and F) at the beginning of the day 1 (today, which is a work day). All of the jobs are due at various times today. Your job is to evaluate four common sequencing rules. JOB DUE (IN HOURS) DURATION (HOURS REQUIRED) A 8 (this job is due in 8 hours) 1.65 B 5.5 (this job is due in 5.5 hours) 1.20 C 4.5 (this job is due after lunch in 4.5 hours) 0.85 D 6 (this job is due in 6…arrow_forwardA serial process has 5 steps – A (4), B(5), C(2), D(6), and E(3) – that have to be performed in this order. The numbers in parentheses are the times (in minutes) needed to process a unit. For each unit produced by this process, the process has a total idle time of: Group of answer choices 1 min 10 mins 6 mins 3 minsarrow_forwardFive jobs are waiting for processing through two work centers. Their processing time (in minutes) at each work center is contained in the table below. Each job requires work center Sigma before work center Delta. According to Johnson's rule, what sequence of jobs will minimize the completion time for all jobs? Job Sigma Delta R 20 10 S 25 30 T 30 20 U 35 35 V 15 25 Part 2 A. V−S−U−T−R B. V−R−U−S−T C. R−V−T−S−U D. S−U−T−V−R E. R−S−T−U−Varrow_forward
- bama pie company's assembly line operations (the assembly line operates for six hundred minutes per day) comprise of eleven tasks, with the longest task time being 2.4 minutes and the shortest task time being 0.4 minutes; the sum of the task times is eighteen minutes. the firm is working on balancing its assembly line operations. the firm needs to produce 200 pies per day; to achieve this, the firm calculates the required cycle time as ---- minutes?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_forwardIn a manufacturing system, the technique of deciding how to assign work to specific work stations (machines) is referred to as_ O a. station allocation O b. line balancing O c. task allocation O d. work allocation O e. process balancingarrow_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.