A memetic algorithm for a stochastic lot-sizing and sequencing problem - Archive ouverte HAL Access content directly
Journal Articles IFAC-PapersOnLine Year : 2015

A memetic algorithm for a stochastic lot-sizing and sequencing problem

(1, 2, 3, 4) , (1, 2, 3, 4) , (1, 2, 3, 4)
1
2
3
4

Abstract

A stochastic multi-product lot-sizing and sequencing problem is considered. Two kinds of uncertainties are integrated into the model: defectives items due to the machines' imperfections and random lead time because of randomly arising breakdowns and uncertain repair time. There are also sequence-dependent set-up times between two items of different types. The optimization problem is to maximize the probability of overall demand satisfying. In the previous work only the lot-sizing part of the problem was considered (a decomposition approach was used). Here we study the entire problem with sequencing and lot-sizing decisions integrated.

Dates and versions

emse-01194466 , version 1 (07-09-2015)

Identifiers

Cite

Kseniya Schemeleva, Xavier Delorme, Alexandre Dolgui. A memetic algorithm for a stochastic lot-sizing and sequencing problem. IFAC-PapersOnLine, 2015, 15th IFAC Symposium on Information Control Problems in Manufacturing — INCOM 2015, (11-13 mai 2015), Ottawa, Canada, 48 (3), pp.Pages 1809-1814. ⟨10.1016/j.ifacol.2015.06.349⟩. ⟨emse-01194466⟩
141 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More