Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
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
ACE Hardware wants to develop a daily schedule for its employees in one of its stores in Omaha. Currently, this store has five employees and the store is opened from 12pm to 9pm. The store must always have at least two people on hand. Each employee must work at least four hours and no more than eight hours per day. Employee #1 goes to school and cannot start before 4pm while all other employees can work at any time. Furthermore, employee #1 earns $10 per hour while all other employees earn $12 per hour. Because all five employees live so close to the store, you must assume that they need to work consecutive hours.
a) Formulate an optimization model for this problem.
b) Solve the optimization model using either the Microsoft Excel Solver
Problem:
Acme Manufacturing produces widgets on an assembly line. The assembly process has five tasks, each with its own processing time:
Task
Processing Time (Seconds)
A
10
B
8
C
12
D
9
E
7
drive_spreadsheetExport to Sheets
Acme currently has two workers assigned to the assembly line, and they work simultaneously. The company wants to improve line efficiency and reduce waste.
Objective:
Balance the assembly line by assigning tasks to each worker in a way that minimizes idle time and maximizes output.
At a machine tool plant, five jobs must be completedeach day. The time it takes to do each job depends on themachine used to do the job. If a machine is used at all, thereis a setup time required. The relevant times are given inTable 20. The company’s goal is to minimize the sum of thesetup and machine operation times needed to complete alljobs. Formulate and solve (with LINDO, LINGO, or ExcelSolver) an IP whose solution will do this.
Machine 1 2 3 4 5 Time (Minutes)1 42 70 93 X X 302 X 85 45 X X 403 58 X X 37 X 504 58 X 55 X 38 605 X 60 X 54 X 20
Chapter 5 Solutions
Practical Management Science
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. 1C
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
- You have been assigned to arrange the songs on the cassette version of the famous music band, Nirvana’s latest album. A cassette tape has two sides (1 and 2). The songs on each side of the cassette must total between 14 and 16 minutes in length. The length and type of each song are given in the table below. The assignment of songs to the tape must satisfy the following conditions. Song Type Length (in minutes) 1 Ballad 4 2 Hit 5 3 Ballad 3 4 Hit 2 5 Ballad 4 6 Hit 3 7 5 8 Ballad and hit 4 Formulate the problem as an IP to determine which song is assigned to which side of thecassette to satisfy the following conditions.a) The songs on each side of the cassette must total between 14 and 16 minutes inlength.b) Each song must be assigned to exactly either one of the sides.c) Each side must have exactly two ballads.d) Side 1 must have at least 3 hit songs.e) Either song 5 or song 6 must be on side 1.f) If song 2…arrow_forwardA company has three warehouses that supply four stores with a given product. Each warehouse has 30 units of the product. Stores 1, 2, 3, and 4 require 20, 25, 30, and 35 units of the product, respectively. The per unit shipping costs from each warehouse to each store are given in the following table. (Let Xij represent the number of units that flow from warehouse i to store j for i = 1, 2, 3 and j = 1, 2, 3, 4.) Store Warehouse 1 2 3 4 1 7 6 7 6 2 4 7 6 5 3 6 4 4 4 Solve the problem using Solver. Caution: You should note that the amount of supply at the warehouses is less than the amount of demand at the stores. You will need to address this when structuring the flow balance constraints. (Hint: You want to ship everything from the warehouses even though there will be a demand shortage at the stores). (X11, X12, X13, X14, X21, X22, X23, X24, X31, X32, X33, X34) = ( ??? ) What is the optimal solution to the modified problem? (X11, X12, X13, X14, X21, X22, X23, X24, X31,…arrow_forwardYou own a wheat warehouse with a capacity of 20,000 bushels. At the beginning of month 1, you have 6,000 bushels of wheat. Each month, wheat can be bought and sold at the price per 1000 bushels given in the Table Month Selling price Purchase price 1 3 8 2 6 8 3 7 2 4 1 3 5 4 4 6 5 3 7 5 3 8 1 2 9 3 5 10 2 5 The sequence of events during each month is as follows:a. You observe your initial stock of wheat.b. You can sell any amount of wheat up to your initial stock at the current month’s selling price.c. You can buy (at the current month’s buying price) as much wheat as you want, subject to the warehouse size limitation.Your goal is to formulate an LP that can be used to determine how to maximize the profit earned over the next 10 months and solve using Excel solverarrow_forward
arrow_back_ios
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,