Differential evolution to solve the lot size problem in stochastic supply chain management systems
type: Item
instance of: scholarly article
title: Differential evolution to solve the lot size problem in stochastic supply chain management systems
zbMATH Open document ID: 1350.90010
author: Kris T. Lieckens
author: Nico J. Vandaele
published in: Annals of Operations Research
publication date: 2016-10-11T00:00:00Z
full work available at URL: https://lirias.kuleuven.be/handle/123456789/483221
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 91B74
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6637050
zbMATH Keywords: differential evolution
zbMATH Keywords: evolutionary optimization
zbMATH Keywords: lot sizing
zbMATH Keywords: production planning
zbMATH Keywords: queueing network
describes a project that uses: JADE
MaRDI profile type: Publication
OpenAlex ID: W2040308678
cites work: Two-stage stochastic lot-sizing problem under cost uncertainty
cites work: Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
cites work: Design of manufacturing systems using queueing models
cites work: Lot Sizes, Lead Times and In-Process Inventories
cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
cites work: Production planning with load dependent lead times: An update of research
cites work: Multi-item batching heuristics for minimization of queueing delays
cites work: Expected time in system analysis of a single-machine multi-item processing center.
cites work: ACLIPS: A capacity and lead time integrated procedure for scheduling
cites work: A Proof for the Queuing Formula: L = λW
cites work: Buffer sizing in multi-product multi-reactor batch processes: Impact of allocation and campaign sizing policies
cites work: Approximations for the time spent in a dynamic job shop with applications to due-date assignment
cites work: Optimal grouping for a nuclear magnetic resonance scanner by means of an open queueing model.
DOI: 10.1007/S10479-014-1778-0
description: scientific article; zbMATH DE number 6637050