Applying particle swarm optimisation to dynamic lot sizing with batch ordering

DOI10.1080/00207540701581783zbMath1198.90405OpenAlexW2082607345MaRDI QIDQ3055436

A. S. Aly, Lofti K. Gaafar

Publication date: 7 November 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701581783

zbMATH Keywords

genetic algorithmslot sizingparticle swarm optimisationbatch orderingsilver-meal

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (1)

Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics

Uses Software

• Unnamed Item

Cites Work

• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• The use of genetic algorithms to solve the economic lot size scheduling problem
• Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
• Dynamic Version of the Economic Lot Size Model
• Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem
• Approximation Formulations for the Single-Product Capacitated Lot Size Problem
• Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
• Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
• Optimization of Batch Ordering under Deterministic Variable Demand

This page was built for publication: Applying particle swarm optimisation to dynamic lot sizing with batch ordering