Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system

DOI10.1016/j.apm.2012.10.024zbMath1426.90132OpenAlexW2006004042MaRDI QIDQ1667804

Reza Ramezanian, Mohammad Saidi-Mehrabad

Publication date: 30 August 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2012.10.024

zbMATH Keywords

Taguchi methodflow shopsequence-dependent setuphybrid meta-heuristicMIP-based heuristicstochastic lot-sizing and scheduling

Mathematics Subject Classification ID

Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (12)

A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches ⋮ Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system ⋮ An integrated economic disposal and lot-sizing problem for perishable inventories with batch production and corrupt stock-dependent holding cost ⋮ Design of mathematical models for the integration of purchase and production lot-sizing and scheduling problems under demand uncertainty ⋮ Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand ⋮ Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating ⋮ Joint energy capacity and production planning optimization in flow-shop systems ⋮ A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems ⋮ A multiproduct batch plant design model incorporating production planning and scheduling decisions under a multiperiod scenario ⋮ Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems ⋮ A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Sample average approximation method for chance constrained programming: Theory and applications
• Multi-level, single-machine lot sizing and scheduling (with initial inventory)
• Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system
• Theory and practice of uncertain programming.
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• Fix and relax heuristic for a stochastic lot-sizing problem
• Dynamic Version of the Economic Lot Size Model
• Some insights into proportional lot sizing and scheduling
• Minimizing the Expected Makespan in Stochastic Flow Shops
• An Integrated Model for Job-Shop Planning and Scheduling
• Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups
• Rolling-horizon lot-sizing when set-up times are sequence-dependent
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system