Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
Students have asked these similar questions
A large paper manufacturing company, the Quality Paper Corporation, has 10 paper mills from which it needs to supply 1,000 customers. It uses three alternative types of machines and four types of raw materials to make five different types of paper. Therefore, the company needs to develop a detailed production distribution plan on a monthly basis, with an objective of minimizing the total cost of producing and distributing the paper during the month. Specifically, it is necessary to determine jointly the amount of each type of paper to be made at each paper mill on each type of machine and the amount of each type of paper to be shipped from each paper millto each customer. The relevant data can be expressed symbolically as follows:Djk = number of units of paper type k demanded by customer j,rklm = number of units of raw material m needed to produce 1 unit of paper type k on machine type l,Rim = number of units of raw material m available at paper mill i,ckl = number of capacity units of…
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.
Given the set of machines M = {m₁, m₂,... m₁}, 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 Star; ΣΤ i=1 where x, {0, 1} for 1 ≤ i ≤n.
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole