Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics

Authors:
Ross J. W. James;Bernardo Almada-Lobo
Affiliations:
Department of Management, University of Canterbury, Private Bag 4800, Christchurch 8140, New Zealand;Faculdade de Engenharia da Universidade do Porto, Porto, Portugal
Venue:
Computers and Operations Research
Year:
2011

Citing 8
Cited 3

Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows

Operations Research
Lot sizing and furnace scheduling in small foundries

Computers and Operations Research
Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs

Computers and Operations Research
A proposal for a hybrid meta-strategy for combinatorial optimization problems

Journal of Heuristics
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic

Computers and Operations Research
Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems

Operations Research
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints

INFORMS Journal on Computing
Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II

Integrated pulp and paper mill planning and scheduling

Computers and Industrial Engineering
Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems

Computers and Operations Research
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a general-purpose heuristic approach combining metaheuristics and mixed integer programming to find high quality solutions to the challenging single- and parallel-machine capacitated lotsizing and scheduling problem with sequence-dependent setup times and costs. Commercial solvers fail to solve even medium-sized instances of this NP-hard problem; therefore, heuristics are required to find competitive solutions. We develop construction, improvement and search heuristics all based on MIP formulations. We then compare the performance of these heuristics with those of two metaheuristics and other MIP-based heuristics that have been proposed in the literature, and to a state-of-the-art commercial solver. A comprehensive set of computational experiments shows the effectiveness and efficiency of the main approach, a stochastic MIP-based local search heuristic, in solving medium to large size problems. Our solution procedures are quite flexible and may easily be adapted to cope with model extensions or to address different optimization problems that arise in practice.