Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system
type: Item
instance of: scholarly article
title: Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system
zbMATH Open document ID: 1426.90132
author: Reza Ramezanian
author: Mohammad Saidi-Mehrabad
published in: Applied Mathematical Modelling
publication date: 2018-08-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6929771
zbMATH Keywords: stochastic lot-sizing and scheduling
zbMATH Keywords: flow shop
zbMATH Keywords: sequence-dependent setup
zbMATH Keywords: MIP-based heuristic
zbMATH Keywords: hybrid meta-heuristic
zbMATH Keywords: Taguchi method
MaRDI profile type: Publication
full work available at URL: j.apm.2012.10.024
OpenAlex ID: W2006004042
cites work: An Integrated Model for Job-Shop Planning and Scheduling
cites work: Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups
cites work: Dynamic version of the economic lot size model
cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
cites work: Multi-level, single-machine lot sizing and scheduling (with initial inventory)
cites work: Some insights into proportional lot sizing and scheduling
cites work: Rolling-horizon lot-sizing when set-up times are sequence-dependent
cites work: Fix and relax heuristic for a stochastic lot-sizing problem
cites work: Q4838490
cites work: Theory and practice of uncertain programming.
cites work: Sample average approximation method for chance constrained programming: Theory and applications
cites work: Minimizing the Expected Makespan in Stochastic Flow Shops
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Optimization by Simulated Annealing
cites work: Feasibility and infeasibility in optimization. Algorithms and computational methods.
cites work: Q4487972
DOI: 10.1016/J.APM.2012.10.024
description: scientific article; zbMATH DE number 6929771