A Concise Intro To Logic
12th Edition
ISBN: 9781305147775
Author: Hurley
Publisher: Cengage
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
error_outline
This textbook solution is under construction.
Students have asked these similar questions
4.Problem in the Image
Please solve with the long anlysis explain and clearly
One 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.
Maximize f = x + y subject to the following constraints:
x
+
2y
≤
8
-2x
+
3y
≤
2
x
≤
4
≤ x
0 ≤ y
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- 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_forwardFind the minimum value of the function z=2x+2y subject to the following constraints. x≤17 y≤16 5x+2y≥42 3x+11y≥84arrow_forwardIn an evaluation of labor assignment rules when workers are not perfectly interchangeable, Paul. M. Bobrowski and Paul Sungchil Park created a dynamic job shop with 9 work centers and 9 workers, both numbered 1–9. The efficiency of each worker is specified in the following labor efficiency matrix, which represents the degree of worker cross-training.† Work Centers 1.00 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 1.00 W o r k e r s (a) For what work center(s) is worker 2 least efficient? (Enter your answers as a comma-separated list.) (b) For what…arrow_forward
- 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_forwardou are given a linear programming problem. Maximize P = 3x + 3y subject to 5x + 3y ≤ 30 Resource 1 2x + 3y ≤ 21 Resource 2 x ≤ 4 Resource 3 y ≥ 0 x ≥ 0 (a) Use the method of corners to solve the problem. The maximum is P = at (x, y) = . (b) Suppose P = cx + 3y. Find the range of values that the coefficient c of x can assume without changing the optimal solution. ≤ c ≤ (c) Find the range of values that Resource 1 can assume. ≤ (Resource 1) ≤ (d) Find the shadow price for Resource 1.arrow_forwardI need a detailed explanation and assistance to solve this proble: A client asks his stockbroker to invest $100,000 for maximum annual income, subject to the three conditions: Spread the investment over no more than three different stocks. Put no more than 40 percent of the money into any one stock Put a minimum of $10,000 into an oil stock. The broker has identified three stocks for investment. Their estimated annual returns per share and price per share are shown in the following table: Stock Price per Share Estimate Annual Return per Share Oil $120 $11 Auto $52 $4 Pharmaceutical $18 $2 The client wishes to use LP to determine the optimal number of shares to buy for each stock, so as to maximize the total estimated return. a) Write down the decision variables. b) Write down the optimization statement for the objective function. c) Write down the constraints.arrow_forward
- Consider the following linear programming model: maximize Z = 3x1 + 2x2 subject to : x1 +x2 ≤ 1 x1 + x2 ≥ 2 x1,x2 ≥ 0 a) Write this model in a standard (augmented) form. (i.e. Introduce slack/surplus, artificial etc.)b) Constract the initial simplex tableau and carry on your calculations to solve this model using the simplex method. Interpret your result.arrow_forwardSuppose a network contains a finite number of arcs andthe capacity of each arc is an integer. Explain why theFord–Fulkerson method will find the maximum flow in thefinite number of steps. Also show that the maximum flowfrom source to sink will be an integer.arrow_forwardExplain what is meant by the assumptions of linear programming ?arrow_forward
- You are to set up a linear programarrow_forwardThe figure below shows the nodes (A−I) and capacities (labelled on arcs in TB/s) of a computer network. The firm would like to know how much information can flow from node A to node I. Which nodes are the sink and source for this problem? Multiple Choice: Node A is the source, Node I is the sink. Node A is the sink, Node B is the source. Node A is the sink, Node I is the source. Node B is the sink, Node I is the source. Node B is the source, Node I is the sink.arrow_forward3. George Heinrich Printing Company wants to schedule the following seven jobs where each job must be processed by two machines A and B, first on machine A and then machine B. The processing times at machine A and B are as follows: Job i 1 2 3 4 5 6 7Processing time on machine A (ai) 15 7 4 7 10 4 7Processing time on machine B (bi) 3 9 10 6 9 5 8 (a) Suppose the inter-arrival times between jobs can be treated as zero and Johnson’srule is used to sequence and process the jobs, what is the completion time of eachjob and what is the total throughput time (makespan) of all jobs? (b) Now suppose that FIFO system (i. e., schedule job l before job 2, etc.) of schedulingand processing the jobs is used. What is the completion time of each job and whatis the total throughput time (makespan) of all jobs? (c) What would be the difference in the average time a job spends in the shop in (a)and (b) above?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
BUSN 11 Introduction to Business Student EditionBusinessISBN:9781337407137Author:KellyPublisher:Cengage Learning
Essentials of Business Communication (MindTap Cou...BusinessISBN:9781337386494Author:Mary Ellen Guffey, Dana LoewyPublisher:Cengage Learning
Accounting Information Systems (14th Edition)BusinessISBN:9780134474021Author:Marshall B. Romney, Paul J. SteinbartPublisher:PEARSON
International Business: Competing in the Global M...BusinessISBN:9781259929441Author:Charles W. L. Hill Dr, G. Tomas M. HultPublisher:McGraw-Hill Education
BUSN 11 Introduction to Business Student Edition
Business
ISBN:9781337407137
Author:Kelly
Publisher:Cengage Learning
Essentials of Business Communication (MindTap Cou...
Business
ISBN:9781337386494
Author:Mary Ellen Guffey, Dana Loewy
Publisher:Cengage Learning
Accounting Information Systems (14th Edition)
Business
ISBN:9780134474021
Author:Marshall B. Romney, Paul J. Steinbart
Publisher:PEARSON
International Business: Competing in the Global M...
Business
ISBN:9781259929441
Author:Charles W. L. Hill Dr, G. Tomas M. Hult
Publisher:McGraw-Hill Education