Solving production scheduling problems using advanced model checking tools

Panopoulos, D; Metaxiotis, K; Ptochos, D; Ligouras, C; Sklaveniti, M

dc.contributor.author	Panopoulos, D	en
dc.contributor.author	Metaxiotis, K	en
dc.contributor.author	Ptochos, D	en
dc.contributor.author	Ligouras, C	en
dc.contributor.author	Sklaveniti, M	en
dc.date.accessioned	2014-03-01T01:55:28Z
dc.date.available	2014-03-01T01:55:28Z
dc.date.issued	2006	en
dc.identifier.issn	02196867	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/27749
dc.subject	Job-shop	en
dc.subject	Model checking	en
dc.subject	Production scheduling	en
dc.subject	Timed automata	en
dc.subject.other	Algorithms	en
dc.subject.other	Automata theory	en
dc.subject.other	Computer simulation	en
dc.subject.other	Graph theory	en
dc.subject.other	Polynomials	en
dc.subject.other	Production control	en
dc.subject.other	Job-shop	en
dc.subject.other	Model checking	en
dc.subject.other	Production scheduling	en
dc.subject.other	Timed automata	en
dc.subject.other	Problem solving	en
dc.title	Solving production scheduling problems using advanced model checking tools	en
heal.type	journalArticle	en
heal.identifier.primary	10.1142/S0219686706000832	en
heal.identifier.secondary	http://dx.doi.org/10.1142/S0219686706000832	en
heal.publicationDate	2006	en
heal.abstract	The main scope of this paper is the implementation of a method for production scheduling, using advanced model checking tools. This method makes use of timed automata in order to model complex production scheduling problems like the job-shop and the open-shop scheduling problems. By modeling scheduling problems using timed automata, feasible schedules correspond then to paths in the automata, while rinding the optimum schedule corresponds to finding the shortest path in an automaton. Several algorithms and heuristics have been proposed to find the shortest paths in timed automata, which are mainly based on the implementation of graph algorithms that search the transition graph. In our work, an advanced model design and checking tool, called Uppaal, has been used to implement and test the above method on a number of different models and to show the effectiveness of such an approach in terms of finding optimal, or near to optimal, schedules in polynomial time, even for large scale problems. © World Scientific Publishing Company.	en
heal.journalName	Journal of Advanced Manufacturing Systems	en
dc.identifier.doi	10.1142/S0219686706000832	en
dc.identifier.volume	5	en
dc.identifier.issue	2	en
dc.identifier.spage	209	en
dc.identifier.epage	232	en