Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Efficient post-optimization analysis procedure for the dynamic lot-sizing problem

Article Abstract:

A study is conducted to evaluate the development of efficient post-optimization analysis for the dynamic lot-sizing problem. The study assumes that the problem involves determination of the level of produced items which satisfies demand while reducing costs. The procedure which establishes a Wagner-Whitin solution is then considered. Results show that the proposed procedure can be applied by using a branch and bound algorithmic context.

Author: Diaby, Moustapha
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993
Production planning

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Optimal setup time reduction for a single product with dynamic demands

Article Abstract:

A dynamic programming procedure for reducing setup times in the dynamic lot-sizing problem is studied. The dynamic programming procedure is shown to be efficient and capable of simultaneously determining optimal setup times and optimal production quantities. The proposed solution is more general than any of its predecessors and this generality allows its application as a building block for setup time reduction models.

Author: Diaby, Moustapha
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Multiple items procurement under stochastic nonstationary demands

Article Abstract:

The sequential decision problem known as constrained, multi-item, stochastic, nonstationary lot sizing problem is considered. Specifically, the stochastic programming concept of rolling planning horizons is employed to recast it as a multi-period static decision problem under risk. A branch and bound algorithm for solving a deterministic version of the stochastic program is also developed.

Author: Martel, Alain, Diaby, Moustapha, Boctor, Fayez
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Operations research, Management science, Purchasing, Case studies, Stochastic programming

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Inventory control, Dynamic programming, Economic lot size
Similar abstracts:
  • Abstracts: An efficient heuristic approach to the scheduling of jobs in a flowshop. A multi-stage parallel-processor flowshop problem with minimum flowtime
  • Abstracts: Priming for Rio: Malaysia sets tone for Earth Summit agenda. Plenty of laws, but little action
  • Abstracts: Driven to distraction: foreign-policy missteps dim Evans's political lustre. A sweeter pill: Liberal leader takes sting out of reform
  • Abstracts: Pilgrim's progress. Let the good times roll
  • Abstracts: A Markov decision algorithm for optimal pest control through uniform catastrophes. Optimal control of a simple immigration-birth-death process through total catastrophes
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.