INFLUENCE OF NBMAX AND TABU LIST IN THE SCHEDULING PROBLEM

Antonio Gabriel Rodrigues, Arthur Tórgo Gómez

2006

Abstract

Considering a Job Shop Scheduling Problems with tooling and due date constraints, experiments were made with a computational model based in Cluster Analysis and Tabu Search. Two minimization policies can be done in this model: swtiching instants and tardiness time. Previous experiments identify the conflict between these policies, as the positive influence of variation of TS parameters. This paper presents experiments considering the influence of the variation of TS paramenters nbmax (number of non-improving iterations performed by TS) and tabu list size.

Paper Citation

in Harvard Style

Gabriel Rodrigues A. and Tórgo Gómez A. (2006). INFLUENCE OF NBMAX AND TABU LIST IN THE SCHEDULING PROBLEM . In Proceedings of the Third International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-972-8865-59-7, pages 217-220. DOI: 10.5220/0001216702170220

in Bibtex Style

@conference{icinco06,
author={Antonio Gabriel Rodrigues and Arthur Tórgo Gómez},
title={INFLUENCE OF NBMAX AND TABU LIST IN THE SCHEDULING PROBLEM},
booktitle={Proceedings of the Third International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2006},
pages={217-220},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001216702170220},
isbn={978-972-8865-59-7},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - INFLUENCE OF NBMAX AND TABU LIST IN THE SCHEDULING PROBLEM
SN - 978-972-8865-59-7
AU - Gabriel Rodrigues A.
AU - Tórgo Gómez A.
PY - 2006
SP - 217
EP - 220
DO - 10.5220/0001216702170220