research-article

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

Authors:

Claudio Fabiano Motta Toledo,

Márcio da Silva Arantes,

Paulo Morelato FrançaAuthors Info & Claims

GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computation

Pages 443 - 448

https://doi.org/10.1145/2001576.2001638

Published: 12 July 2011 Publication History

Abstract

This paper proposes a tabu search approach to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem (SITLSP). It is a real-world problem, often found in soft drink companies, where the production process has two integrated levels with decisions concerning raw material storage and soft drink bottling. Lot sizing and scheduling of raw materials in tanks and products in bottling lines must be simultaneously determined. Real data provided by a soft drink company is used to make comparisons with a previous genetic algorithm. Computational results have demonstrated that tabu search outperformed genetic algorithm in all instances.

References

[1]

ABIR, Brazilian Association of Soft Drink Industry, Report available in: http://www.abir.gov.br (last visit in 15/05/2010).

[2]

Al-Fawzan, M. A. An algorithm for production planning in a flexible production system. Computer and Industrial Engineering, 48(4), 2005, 681--691.

Digital Library

[3]

Araujo, S. A., Arenales, M. N. and Clark, A. R. Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups. Journal of Heuristics, 13, 2007, . 337--358.

Digital Library

[4]

Beraldi, P., Ghianib, G., Griecob, A., and Guerriero, E. Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs. Computers & Operations Research, 35, 2008, 3644-- 3656.

Digital Library

[5]

Berretta, R. E., França, P. M. and Armentano, V. A. Metaheuristic approaches for the multilevel resource-constrained lot-sizing problem with setup and lead times. Asia-Pacific Journal of Operational Research, 22 (2), 2005, 261--286.

[6]

Bitran, G. R. and Yanasse, H. H. Computational complexity of the capacitated lot size problem. Management Science, 28 (10), 1982, 1174--1186.

Digital Library

[7]

Buscher, U. and Shen, L. An integrated tabu search algorithm for the lot streaming problem in job shops. European Journal of Operation Research, 199(2), 2009, 385--399.

[8]

Chen, W. H. and Thizy, J. M. Analysis of relaxations for the multi-item capacitated lot-sizing problem. Annals of Operations Research, 26, 1990, 29--72.

Digital Library

[9]

Clark, A. R. Hybrid heuristics for planning lot setups and sizes. Computers & Industrial Engineering, vol. 45, 2003, 545--562.

Digital Library

[10]

Clark, A., Morabito, R. and Toso, E. Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching. Journal of Scheduling, 13 (2), 2009, 111--121.

[11]

Drexl, A. and Kimms, A. Lot-sizing and scheduling - survey and extensions. European Journal of Operational Research, 99, 1997, 221--235.

[12]

Ferreira, D., Morabito, R. and Rangel, S. Solution approaches for the soft drink integrated production lot sizing and scheduling problem. European Journal of Operational Research, 196, 2009, 697--706.

[13]

Ferreira, D., Morabito, R. and Rangel, S. Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants. Computers & Operations Research, 37, 2010, 684--691.

Digital Library

[14]

Glover, and Laguna, M. Tabu Search, Kluwer, Norwell, MA, 1997.

Digital Library

[15]

Hung, Y. F., Chen, C. P., Shih, C. C. and Hung, M. H. Using tabu search with ranking candidate list to solve production planning problems with setups. Computers & Industrial Engineering, 45, 2003, 615--634.

Digital Library

[16]

Jan, R. and Degraeve, Z. Modeling industrial lot sizing problems: A review. ERIM Report Series Reference, No. ERS-2005-049-LIS. Available at SSRN: http://ssrn.com/abstract=902728, 2005.

[17]

Jans, R. and Degraeve, Z, Metaheuristics for dynamic lot sizing: A review and comparison of solution approaches. European Journal of Operational Research, 177, 2007, 1855--1875.

[18]

Karimi,B. Ghomi Fatemi, S. M. T., and Wilson, J.M. The capacitated lot sizing problem: a review of models and algorithms. Omega, 31, 2003, 365--378.

[19]

Kimms, A. A genetic algorithm for multi-level, multi-machine lot sizing and scheduling. Computers & Operations Research 26, 1999, 829--848.

Digital Library

[20]

Luche, J. R. D., Morabito, R. and Pureza, V. Combining process selection and lot sizing models for production scheduling of electrofused grains. Asia-Pacific Journal of Operational Research 26(3), 2009, 421--443.

[21]

Maes, J., Mc Clain, J. O. and Van Wassenhove, L. N. Multilevel capacitated lot sizing complexity and LP-based heuristics. European Journal of Operational Research, 53(2), 1991, 131--148.

[22]

Robinson, P., Narayananb, A., and Sahinc, F. Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms. Omega, 37, 2009, 3-- 15.

[23]

Toledo, C. F. M., França, P. M., Kimms, A. and Morabito, R. A multi-population genetic algorithm approach to solve the synchronized and integrated two-level lot sizing and scheduling problem. International Journal of Production Research, 47, 2009, 3097--3119.

[24]

Toledo, C. F. M., França, P. M., Morabito, R. and Kimms, A. An optimization model for the synchronized and integrated two-level lot sizing and scheduling problem in soft drink industries. Pesquisa Operacional,. 27 (1), 2007, 155--186.

[25]

Toso, E. A. V., Morabito, R. and Clark, A. R. Lot sizing and sequencing optimization at an animal-feed plant. Computers & Industrial Engineering, 57, 2009, 813--821.

Digital Library

Cited By

Briskorn DZeise P(2019)A cyclic production scheme for the synchronized and integrated two-level lot-sizing and scheduling problem with no-wait restrictions and stochastic demandOR Spectrum10.1007/s00291-019-00555-yOnline publication date: 30-Apr-2019
https://doi.org/10.1007/s00291-019-00555-y
Verma MSharma R(2015)Lagrangian based approach to solve a two level capacitated lot sizing problemCogent Engineering10.1080/23311916.2015.10088612:1(1008861)Online publication date: 13-Feb-2015
https://doi.org/10.1080/23311916.2015.1008861

Index Terms

Tabu search to solve the synchronized and integrated two-level lot sizing and scheduling problem
1. Computing methodologies
  1. Artificial intelligence
    1. Planning and scheduling
    2. Search methodologies
      1. Heuristic function construction

Recommendations

GRASP with path relinking for the weighted MAXSAT problem

A GRASP with path relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is described in this paper. GRASP, or Greedy Randomized Adaptive Search Procedure, is a randomized multistart metaheuristic, where, ...
A tabu search/path relinking algorithm to solve the job shop scheduling problem

We present an algorithm that incorporates a tabu search procedure into the framework of path relinking to generate solutions to the job shop scheduling problem (JSP). This tabu search/path relinking (TS/PR) algorithm comprises several distinguishing ...
A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover

This paper presents a tabu-search heuristic for the capacitated lot-sizing problem CLSP with set-up carryover. This production-planning problems allows multiple items to be produced within a time period, and setups for items to be carried over from one ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computation

July 2011

2140 pages

ISBN:9781450305570

DOI:10.1145/2001576

Editor:
Natalio Krasnogor
University of Nottingham, UK
,
General Chair:
Pier Luca Lanzi
Politecnico di Milano, Italy

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 July 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO '11

Sponsor:

SIGEVO

GECCO '11: Genetic and Evolutionary Computation Conference

July 12 - 16, 2011

Dublin, Ireland

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
194
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Briskorn DZeise P(2019)A cyclic production scheme for the synchronized and integrated two-level lot-sizing and scheduling problem with no-wait restrictions and stochastic demandOR Spectrum10.1007/s00291-019-00555-yOnline publication date: 30-Apr-2019
https://doi.org/10.1007/s00291-019-00555-y
Verma MSharma R(2015)Lagrangian based approach to solve a two level capacitated lot sizing problemCogent Engineering10.1080/23311916.2015.10088612:1(1008861)Online publication date: 13-Feb-2015
https://doi.org/10.1080/23311916.2015.1008861

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents