loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Miguel A. González ; María R. Sierra ; Camino R. Vela ; Ramiro Varela and Jorge Puente

Affiliation: University of Oviedo, Spain

ISBN: 978-972-8865-69-6

Keyword(s): Metaheuristics, Genetic Algorithms, Local Search, Job Shop Scheduling.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Enterprise Software Technologies ; Intelligent Problem Solving ; Knowledge Engineering and Ontology Development ; Knowledge-Based Systems ; Software Engineering ; Symbolic Systems

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.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.231.229.89

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
A. González M.; R. Sierra M.; R. Vela C.; Varela R.; Puente J. and (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

@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},
}

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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.