A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem

Authors:
Silvio Alexandre Araujo;Alistair Clark
Affiliations:
Departamento de Matemática Aplicada, Universidade Estadual Paulista (Unesp), Rua Cristovão Colombo 2265, São José do Rio Preto, SP 15054-000, Brazil;Department of Engineering Design and Mathematics, University of the West of England, Coldharbour Lane, Bristol BS16 1QY, United Kingdom
Venue:
Computers and Industrial Engineering
Year:
2013

Citing 14
Cited 0

Determining lot sizes and resource requirements: A review

Operations Research
Integer and combinatorial optimization

Integer and combinatorial optimization
Solving multi-item capacitated lot-sizing problems using variable redefinition

Operations Research
Analysis of relaxations for the multi-item capacitated lot-sizing problem

Annals of Operations Research
Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation

Management Science
Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs

Management Science
A General Heuristic for Production Planning Problems

INFORMS Journal on Computing
Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

Journal of Heuristics
Lot sizing and furnace scheduling in small foundries

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

INFORMS Journal on Computing
Lot sizing and sequencing optimisation at an animal-feed plant

Computers and Industrial Engineering
Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants

Computers and Operations Research
A knapsack problem as a tool to solve the production planning problem in small foundries

Computers and Operations Research
Improved lower bounds for the capacitated lot sizing problem with setup times

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many production processes, a key material is prepared and then transformed into different final products. The lot sizing decisions concern not only the production of final products, but also that of material preparation in order to take account of their sequence-dependent setup costs and times. The amount of research in recent years indicates the relevance of this problem in various industrial settings. In this paper, facility location reformulation and strengthening constraints are newly applied to a previous lot-sizing model in order to improve solution quality and computing time. Three alternative metaheuristics are used to fix the setup variables, resulting in much improved performance over previous research, especially regarding the use of the metaheuristics for larger instances.