Search

Showing posts with label heuristic. Show all posts
Showing posts with label heuristic. Show all posts

Heuristic approaches to determine base-stock levels in a serial supply chain with a single objective and with multiple objectives [An article from: European Journal of Operational Research]

Great Price "Heuristic approaches to determine base-stock levels in a serial supply chain with a single objective and with multiple objectives [An article from: European Journal of Operational Research]" for $7.95 Today







Price : $7.95
Offer Price : $7.95



Heuristic approaches to determine base-stock levels in a serial supply chain with a single objective and with multiple objectives [An article from: European Journal of Operational Research] Overviews

This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
This paper deals with the problem of determination of installation base-stock levels in a serial supply chain. The problem is treated first as a single-objective inventory-cost optimization problem, and subsequently as a multi-objective optimization problem by considering two cost components, namely, holding costs and shortage costs. Variants of genetic algorithms are proposed to determine the best base-stock levels in the single-objective case. All variants, especially random-key gene-wise genetic algorithm (RKGGA), show an excellent performance, in terms of convergence to the best base-stock levels across a variety of supply chain settings, with minimum computational effort. Heuristics to obtain base-stock levels are proposed, and heuristic solutions are introduced in the initial population of the RKGGA to expedite the convergence of the genetic search process. To deal with the multi-objective supply-chain inventory optimization problem, a simple multi-objective genetic algorithm is proposed to obtain a set of non-dominated solutions.

Affordable Price at Store Check Price Now!





*** Product Information and Prices Stored: May 07, 2010 16:21:05


Tags : All About Kangol Hats - Best Deals, Discounts Best iPhone Programming Textbooks Best Price And Reviews On Womens Black Velvet Blazer Best Price And Reviews On Pillow Throws

Read more

An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem [An article from: European Journal of Operational Research]

Great Price "An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem [An article from: European Journal of Operational Research]" for $7.95 Today







Price : $7.95
Offer Price : $7.95



An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem [An article from: European Journal of Operational Research] Overviews

This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
This paper addresses a real-life 1.5D cutting stock problem, which arises in a make-to-order plastic company. The problem is to choose a subset from the set of stock rectangles to be used for cutting into a number of smaller rectangular pieces so as to minimize total production cost and meet orders. The total production cost includes not only material wastage, as in traditional cutting stock problems, but also production time. A variety of factors are taken into account, like cutter knife changes, machine restrictions, due dates and other work in progress limitations. These restrictions make the combinatorial structure of the problem more complex. As a result, existing algorithms and mathematical models are no longer appropriate. Thus we developed a new 1.5D cutting stock model with multiple objectives and multi-constraints and solve this problem in an incomplete enumerative way. The computational results show that the solution procedure is easy to implement and works very well.

Affordable Price at Store Check Price Now!





*** Product Information and Prices Stored: May 03, 2010 11:06:09


Visit : Best iPad Development Textbooks Best Objective-C Programming Textbooks BUY "Bicycle Trailers" With Affordable Price NOW!! Best Price And Reviews On White Television Stand Best Price And Reviews On Personalized Throw Best Deals And Reviews On Carousel Gumball Machines

Read more

Labels