Optimization of economic lot scheduling problem with backordering and shelf-life considerations using calibrated metaheuristic algorithms
DOI10.1016/j.amc.2014.11.035zbMath1328.90009OpenAlexW2088709433MaRDI QIDQ903019
Maryam Mohammadi, Ardeshir Bahreininejad, Siti Nurmaya Musa
Publication date: 4 January 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.11.035
simulated annealinggenetic algorithmparticle swarm optimizationartificial bee colonyTaguchieconomic lot scheduling problem
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case
- The economic lot scheduling problem: a pure genetic search approach
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
- The use of genetic algorithms to solve the economic lot size scheduling problem
- A genetic algorithm approach to optimize a multi-products EPQ model with discrete delivery orders and constrained space
- Network Models and Optimization
- The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
- Optimal cycle time and production rate in a family production context with shelf life considerations
- A note on ‘Effect of production cost on shelf life’
- Incorporating planned backorders in a family production context with shelf-life considerations
- Hybrid genetic algorithm for the economic lot-scheduling problem
- On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
- A Dynamic Programming Approach to a Lot Size Scheduling Problem
This page was built for publication: Optimization of economic lot scheduling problem with backordering and shelf-life considerations using calibrated metaheuristic algorithms