Job-Shop Scheduling Using Timed Automata


In this paper we show how the classical job shop scheduling problem can be modeled as a special class of acyclic timed automata Finding an optimal schedule corresponds then to nding a shortest in terms of elapsed time path in the timed automaton This representa tion provides new techniques for solving the optimization problem and more importantly it allows… (More)
DOI: 10.1007/3-540-44585-4_46


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

94 Citations

Semantic Scholar estimates that this publication has 94 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics