Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions

DOI10.1016/S0377-2217(97)00269-5zbMath0948.90009MaRDI QIDQ1303540

Şevket İlker Birbil, Linet Özdamar

Publication date: 27 November 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicssimulated annealingtabu searchgenetic algorithmsparallel processorsscheduling problemcapacitated lot sizing and loading problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (20)

Mathematical programming model for centralised master planning in ceramic tile supply chains ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Hybrid methods for lot sizing on parallel machines ⋮ Infeasibility handling in genetic algorithm using nested domains for production planning ⋮ Just-in-Time Planning and Lot-Sizing ⋮ Stochastic dynamic lot-sizing problem using bi-level programming base on artificial intelligence techniques ⋮ Capacitated lot-sizing with extensions: a review ⋮ Modeling industrial lot sizing problems: a review ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ The multi-item capacitated lot-sizing problem with setup times and shortage costs ⋮ A capacitated lot sizing problem with stochastic setup times and overtime ⋮ Applying particle swarm optimisation to dynamic lot sizing with batch ordering ⋮ Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem ⋮ Replenishment policy based on modified ant colony optimisation and statistical analysis under the pre-order penetration point ⋮ Discrete lot sizing and scheduling using product decomposition into attributes ⋮ Conceptual framework for lot-sizing and scheduling of flexible flow lines ⋮ A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test ⋮ Experiments with new stochastic global optimization search techniques ⋮ Heuristic genetic algorithms for general capacitated lot-sizing problems ⋮ Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach

Uses Software

• Genocop
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The discrete lot-sizing and scheduling problem
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• A state-of-the-art review of parallel-machine scheduling research
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• On the computational complexity of (maximum) class scheduling
• Some experiments with simulated annealing techniques for packing problems
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
• A new heuristic approach for the multi-item dynamic lot sizing problem
• Integration of lotsizing and scheduling decisions in a job-shop
• Genetic algorithms and tabu search: Hybrids for optimization
• Planning lot sizes and capacity requirements in a single stage production system
• Fast algorithms for bin packing
• Parallel genetic algorithms with local search
• Heuristics for Multilevel Lot-Sizing with a Bottleneck
• Computational Complexity of the Capacitated Lot Size Problem
• Some Extensions of the Discrete Lotsizing and Scheduling Problem
• A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
• Tabu Search—Part I
• Tabu Search—Part II
• A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
• Evaluating capacity change and setup time reduction in a capacity-constrained, joint lot sizing situation
• Heuristic family disaggregation techniques for hierarchical production planning systems
• Simultaneous lot sizing and loading of product families on parallel facilities of different classes
• Dynamic Production Scheduling for a Process Industry
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
• Integrative versus separate cycle scheduling heuristics for capacitated discrete lot sizing and sequencing problems

This page was built for publication: Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions