Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

Authors:
Silvio A. Araujo;Marcos N. Arenales;Alistair R. Clark
Affiliations:
Universidade Estadual Paulista, Sao Jose do Rio Preto, Brazil;Universidade de São Paulo, Sao Carlos, Brazil;Faculty of Computing, Engineering and Mathematical Sciences, University of the West of England, Bristol, UK BS16 1QY
Venue:
Journal of Heuristics
Year:
2007

Citing 9
Cited 10

Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem

Journal of Computational and Applied Mathematics - Special issue in honor of Professor Dr. F. Broeckx
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
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
Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows

Operations Research
The Capacitated Lot-Sizing Problem with Linked Lot Sizes

Management Science
Hybrid heuristics for planning lot setups and sizes

Computers and Industrial Engineering
Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs

Computers and Operations Research
The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times

Computers and Operations Research

Lot sizing and furnace scheduling in small foundries

Computers and Operations Research
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
Scheduling production for a sawmill: A comparison of a mathematical model versus a heuristic

Computers and Industrial Engineering
Genetic algorithm-based heuristic for capacitated lotsizing problem in flow shops with sequence-dependent setups

Expert Systems with Applications: An International Journal
A knapsack problem as a tool to solve the production planning problem in small foundries

Computers and Operations Research
Tabu search to solve the synchronized and integrated two-level lot sizing and scheduling problem

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Annual production budget in the beverage industry

Engineering Applications of Artificial Intelligence
Multi-stage simultaneous lot-sizing and scheduling for flow line production

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

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry.