Given the set of machines M = {m₁, m₂,...mn), each associated with a maintenance cost c, and throughput t, where 1 ≤ i ≤n. The objective is to determine which machines to execute in the production line so that the total throughput is greater than or equal to a given minimum throughput and total maintenance cost is minimized. Consider the following problems: (a) Given the minimum total throughput T. Write an O(nT) algorithm to determine the minimum maintenance cost such that minimize Scri subject to t,r, ≥T, i=1 where z; € {0,1} for 1 ≤ i ≤n.

Given the set of machines M = {m₁, m₂,...mn), each associated with a maintenance cost c, and throughput t, where 1 ≤ i ≤n. The objective is to determine which machines to execute in the production line so that the total throughput is greater than or equal to a given minimum throughput and total maintenance cost is minimized. Consider the following problems: (a) Given the minimum total throughput T. Write an O(nT) algorithm to determine the minimum maintenance cost such that minimize Scri subject to t,r, ≥T, i=1 where z; € {0,1} for 1 ≤ i ≤n.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter19: Probabilistic Dynamic Programming

Section19.4: Further Examples Of Probabilistic Dynamic Programming Formulations

Problem 3P

See similar textbooks

Similar questions

A contractor owns three excavators of different capacity. He/she wants to dispatch these excavatorsinto three different jobs. The performance of the excavators is measured as the time consumed toperform each job. The data of the time tests are shown as given in the table below. (a) Draw a network flow diagram.(b) Formulate a mathematical model to obtain the minimum time.(c) Solve this model using the Vogel’s approximation model.
One important factor in inventory control is measured using the variance of the daily demand for the product. A management scientist has developed the optimal order quantity, assuming that the variance is equal to 250. Recently, the company has experienced some inventory problems, which induced the operation manager to doubt the assumption. To examine the problem, the manager recorded the daily demands for 12 random days. The data is in Table 1. 188 212 176 213 182 203 185 214 213 209 199 229 By assuming the data of daily demands is normally distributed, can we conclude that the operation manager’s doubt is true? Use the confidence interval approach.
13.9 M/M/1/2 Consider an M/M/1/2 (see Exercise 13.5) with arrival rate λ, service rate μ, and finite capacity of 2. Derive E [T1,0 ], the mean time to go from having one job in the system until the system is empty.
We consider the following scheduling problem: INPUT: A collection of jobs J1, ··· , Jn. The size of job Ji is xi, which is a non-negative integer. An integer m. OUTPUT: A nonpreemptive feasible schedule for these jobs on m processor that minimizes the total n completion time Pn i=1 Ci . A schedule specifies for each unit time interval and for each processor, the unique job that that is run during that time interval on that processor. In a feasible schedule, every job Ji has to be run for exactly xi time units after time 0. In a nonpreemptive schedule, once a job starts running on a particular processor, it has to be run to completion on that particular processor. The completion time Ci for job Ji is the earliest time when Ji has been run for xi time units. So for example if m = 2 jobs of size 1, 4, 3 are run in that order on the first processor, and jobs of size 7, 10 are run on the second processor in that order, then the total completion time would be 1 + 5 + 8 + 7 + 17…
1. Consider the following preemptive variant of the Load Balancing problem: There are m identical machines, and n jobs with processing times t1, t2, ..... tn respectively. Each machine can process at most one job at a time. Each job can run on more than one machines but must run on at most one machine at any time. Let T = max{max1<=j<=n tj ,1/ m Σ 1<=j<=n tj } : (a) Prove that the optimal makespan is at least T. (b) Give a linear-time algorithm which produces a preemptive schedule with makespan exactly T.
Consider a sequence of operations fi= 1,2,3, ⋯ , m. Use the Potential method. First, define the amortized cost ai and the actual cost ti for each operation fi. Hint: you need to first define the potential function and find the relationship between amortized cost, true cost, and the change in potential. Then, show that the amortized cost of the entire sequence of operations is at least the total actual cost. Full marks are given for complete mathematical formulation.
Consider the dual of a minimum cost network flow problem in which the costs are integer. Prove that the basic feasible solutions are integer.
Please explain! Dynamic Programming can be used to solve numerous real-life optimization problems. Consider these six problems.Five of these six problems have elegant and efficient solutions using Dynamic Programming, but one of these problems does not. Which of these six problems cannot be solved using Dynamic Programming? Choice 1 of 6: Given a rod, and a set of prices p[i] for each cut of length i, determine how to cut the rods to maximize your profit Choice 2 of 6: Given a rod, and a set of prices p[i] for each cut of length i, determine how to cut the rods to minimize your profit Choice 3 of 6: Given a graph, determine the shortest path from the start vertex to the end vertex without repeating any edges Choice 4 of 6: Given a graph, determine the longest path from the start vertex to the end vertex without repeating any edges Choice 5 of 6: Given a sequence of integers, determine the longest increasing subsequence of that sequence Choice 6 of 6: Given a sequence of integers,…
South Africans and Botswanaans enjoy Chakalaka and Beer. Suppose that these are the only two products they consume and produce with Chakalaka being relatively more labour intensive and Beer being relatively more capital intensive in the production process ( αb=0.8 and αc=0.2). Suppose that, as a result of the Southern African Customs Union, all impediments or barriers to trade are lifted, such that these countries can freely trade both goods without any costs. Assuming that an Entrepreneur knows the price of both these goods and both goods are produced, using the Learner diagram describe how the entrepreneur chooses the cost-minimising combinations of inputs in the production of both goods based on the neoclassical trade theory.
In Figure, suppose that the wellheads can be divided into two groups depending on gas pressure: a high-pressure group that includes wells 2, 3, 4, and 6 and a low-pressure group that includes wells 5, 7, 8, and 9 . Because of pressure difference, it is not possible to link the wellheads from the two groups. At the same time, both groups must be connected to the delivery point through wellhead 1. Determine the minimum pipeline network for this situation. Choices: a.) Set length of arcs 3-5, 5-3, 4-5, 5-4, 4-7, 7-4, 5-6, and 6-5 to ∞ : Total length = 53 b.) Set length of arcs 3-5, 5-3, 4-5, 5-4, 4-7, 7-4, 5-6, and 6-5: Total length = 53 c.) Set length of arcs 3-5, 5-3, 4-5, 5-4, 4-7, 7-4, 5-6, and 6-7 to ∞ : Total length = 53 d.) Set length of arcs 3-5, 5-3, 4-5, 5-4, 4-7, 7-4, and 6-5 to ∞ : Total length = 53
Recall Pigou’s example discussed in class, where there are two roads that connect a source, s, and destination, t. The roads have different travel costs. Fraction x1 of the traffic flow on route 1, and the remainder x2 on route 2. Here consider the following scenario. • The first road has “infinite” capacity but is slow and requires 1 hour travel time, T1 = 1. • The second road always requires at least 15 mins, which then increases as a function of traffic density, T2 = 0.25 + 0.75x2. If drivers act in a “selfish” manner – the user optimal scenario – all the traffic will flow on the second path, as one is never worse off. Worst case scenario for path 2, both paths take one hour. So no one is incentivized to change their behavior. 1. Assume user optimal behavior, and calculate τ the expected travel time per car. 2. If instead we could control the flows, we could minimize the expected travel time. Using the expression in part (a), calculate the optimal allocation of flows x¯1 and ¯x2…
A company wants to plan production for the ensuing year to minimize the combined cost of production and inventory costs. In each quarter of the year, demand is anticipated to be 130, 160, 250, and 150 units, respectively. The plant can produce a maximum of 200 units each quarter. The product can be manufactured at a cost of $15 per unit during the first quarter, however the manufacturing cost is expected to rise by $1 per quarter. Excess production can be stored from one quarter to the next at a cost of $1.50 per unit, but the storage facility can hold a maximum of 60 units. How should the production be scheduled so as to minimize the total costs? Please answer using python Formulate an LP model to minimize costs. Solve the LP (provide exact values for all variables and the optimal objective function).