DocumentCode :
2317870
Title :
A model for job-shop problem
Author :
Arfi, Farid ; Saïdouni, Djamel Eddine ; Ilié, Jean-Michel
Author_Institution :
MISC Lab., Univ. Mentouri Constantine, Constantine, Algeria
fYear :
2012
fDate :
24-26 March 2012
Firstpage :
1
Lastpage :
6
Abstract :
In this paper, we present a timed model called Resources Allocation Timed Automata (RATA), expressing parallel behaviors in natural way and supporting at the same time explicit action duration and shared resources. We show how the classical job-shop scheduling problem can be modeled naturally in RATA model, we present also two algorithms for finding the shortest paths in RATA model for the problem of job-shop and test their implementation.
Keywords :
automata theory; job shop scheduling; resource allocation; set theory; RATA model; job-shop problem model; job-shop scheduling problem; parallel behaviors; resource allocation timed automata; resource sharing; shortest paths; timed model; Automata; Clocks; Cost accounting; Data models; Schedules; Scheduling; Semantics; Scheduling; maximality semantics; timed model;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology and e-Services (ICITeS), 2012 International Conference on
Conference_Location :
Sousse
Print_ISBN :
978-1-4673-1167-0
Type :
conf
DOI :
10.1109/ICITeS.2012.6216644
Filename :
6216644
Link To Document :
بازگشت