Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets

DOI10.1080/00207549608905025zbMath0930.90042OpenAlexW1997256589MaRDI QIDQ4230222

Alf Kimms

Publication date: 1 March 1999

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

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

zbMATH Keywords

tabu searchheuristic approachesmulti-level, single-machine lot sizingrandomized regret

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ New lot sizing heuristics for demand and price uncertainties with service-level constraint ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ A tabu search heuristic for scheduling the production processes at an oil refinery ⋮ Modeling industrial lot sizing problems: a review ⋮ Lot sizing and scheduling -- survey and extensions

Uses Software

• LINDO
• Mlclsp

Cites Work

• Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
• The tabu search metaheuristic: How we used it
• Applying tabu search to the job-shop scheduling problem
• Statistical search methods for lotsizing problems
• Scheduling of Project Networks by Job Assignment
• Optimal Lot-Sizing Algorithms for Complex Product Structures
• Tabu Search—Part II
• Common Cycle Lot-Size Scheduling for Multi-Product, Multi-Stage Production
• DLSP for two-stage multi-item batch production
• Efficient, Effective Lot Sizing for Multistage Production Systems
• A Lower Bound and an Efficient Heuristic for Multistage Multiproduct Distribution Systems
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

This page was built for publication: Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets