COMBINING METAHEURISTICS FOR THE JOB SHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES

Miguel A. González, María R. Sierra, Camino R. Vela, Ramiro Varela, Jorge Puente

2006

Abstract

The Job Shop Scheduling (J SS) is a hard problem that has interested to researchers in various fields such as Operations Research and Artificial Intelligence during the last decades. Due to its high complexity, only small instances can be solved by exact methods, while instances with a size of practical interest should be solved by means of approximate methods guided by heuristic knowledge. In this paper we confront the Job Shop Scheduling with Sequence Dependent Setup Times (SDJ SS). The SDJ SS problem models many real situations better than the J SS. Our approach consists in extending a genetic algorithm and a local search method that demonstrated to be efficient in solving the J SS problem. We report results from an experimental study showing that the proposed approaches are more efficient than other genetic algorithm proposed in the literature, and that it is quite competitive with some of the state-of-the-art approaches.

Paper Citation

in Harvard Style

A. González M., R. Sierra M., R. Vela C., Varela R. and Puente J. (2006). COMBINING METAHEURISTICS FOR THE JOB SHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES . In Proceedings of the First International Conference on Software and Data Technologies - Volume 2: ICSOFT, ISBN 978-972-8865-69-6, pages 211-218. DOI: 10.5220/0001312402110218

in Bibtex Style

@conference{icsoft06,
author={Miguel A. González and María R. Sierra and Camino R. Vela and Ramiro Varela and Jorge Puente},
title={COMBINING METAHEURISTICS FOR THE JOB SHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES},
booktitle={Proceedings of the First International Conference on Software and Data Technologies - Volume 2: ICSOFT,},
year={2006},
pages={211-218},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001312402110218},
isbn={978-972-8865-69-6},
}

in EndNote Style

TY - CONF
JO - Proceedings of the First International Conference on Software and Data Technologies - Volume 2: ICSOFT,
TI - COMBINING METAHEURISTICS FOR THE JOB SHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES
SN - 978-972-8865-69-6
AU - A. González M.
AU - R. Sierra M.
AU - R. Vela C.
AU - Varela R.
AU - Puente J.
PY - 2006
SP - 211
EP - 218
DO - 10.5220/0001312402110218