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

Authors:
Patrizia Beraldi;Gianpaolo Ghiani;Antonio Grieco;Emanuela Guerriero
Affiliations:
Dipartimento di Elettronica, Informatica e Sistemistica and Excellence Center on High Performance Computing, Universití degli Studi della Calabria, 87030 Rende (CS), Italy;Dipartimento di Ingegneria dell'Innovazione, Universití degli Studi di Lecce, 73100 Lecce, Italy;Dipartimento di Ingegneria dell'Innovazione, Universití degli Studi di Lecce, 73100 Lecce, Italy;Dipartimento di Ingegneria dell'Innovazione, Universití degli Studi di Lecce, 73100 Lecce, Italy
Venue:
Computers and Operations Research
Year:
2008

Citing 3
Cited 6

Parallel machine scheduling with splitting jobs

Discrete Applied Mathematics
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Dynamic Version of the Economic Lot Size Model

Management Science

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

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

Expert Systems with Applications: An International Journal
Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics

Computers and Operations Research
Integrating parts design characteristics and scheduling on parallel machines

Expert Systems with Applications: An International Journal
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
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

In this paper we develop new rolling-horizon and fix-and-relax heuristics for the identical parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs. Unlike previous papers, our procedures are based on a compact formulation relying on the hypotheses of identical machines. This feature makes our approach suitable for large-scale applications (with hundreds of machines) arising in the textile and fiberglass industries. Moreover, our procedures are shown to provide a feasible solution for any feasible instance. Comparisons with lower bounds provided by a truncated branch-and-bound show that the gap between the best heuristic solution and the lower bound never exceeds 3%.