期刊
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
卷 199, 期 -, 页码 179-192出版社
ELSEVIER
DOI: 10.1016/j.ijpe.2018.02.017
关键词
Stochastic production lines; Lot-sizing; Sequencing; Decomposition; Dynamic programming; Genetic algorithms
A stochastic multi product lot sizing and sequencing problem is studied. Two kinds of uncertainties are integrated into the model: defective items due to the process imperfections and random lead times because of randomly arising machine breakdowns and uncertain repair times. There are also sequence-dependent set-up times between two items of different types. The objective is to find a sequence of lots and lot sizes maximizing the probability of demand satisfaction for all products. A decomposition approach has been proposed in the literature to reduce this problem to a sequence of known optimization problems with different algorithms available for each of them. However, a proper evaluation of the practical performance of the whole method has never been presented. The goal of this paper is to analyze and compare the behavior of different solution frameworks (with and without decomposition) and techniques for the considered problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据