Abstract
In this paper, we propose a pruning method in order to reduce the search space for the job-shop scheduling problem with makespan minimization. In RATA model each trace corresponds to a feasible schedule, so we apply this method to the reachability algorithm of RATA model that explores the space of all possible schedules. We conducted an experimental study over a set of benchmarks. The results show that the proposed method is able to reduce both the space and the time in searching for optimal schedules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Subanatarajan, S., Thomas, T., Sebastian, P., Sebastian, E.: Multi-product Batch Scheduling with Intermediate Due Dates Using Priced Timed Automata Models. J. Computers and Chemical Engineering 33, 1661–1676 (2009)
Abdeddaim, Y., Asarin, E., Maler, O.: Scheduling with timed automata. J. Theoretical Computer Science 354(2), 272–300 (2006)
Abdeddaïm, Y., Maler, O.: Preemptive job-shop scheduling using stopwatch automata. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 113–126. Springer, Heidelberg (2002)
Belala, N., Saïdouni, D.E.: Non-Atomicity in Timed Models. In: ACIT 2005, Al-Isra Private University, Jordan (2005)
Alur, R., Dill, D.: A Theory of Timed Automata. J. TCS 126, 183–235 (1994)
Mokhdad, A., Ilié, J.M., Saidouni, D.E.: Addressing State Space Explosion Problem in Performance Evaluation Using Maximality-based Labeled Stochastic Transition Systems. In: 2nd International Conference on Computer and Software Modeling (ICCSM 2012), India, (2012)
Abdeddaim, Y., Niebert, P.: On the use of partial order methods in scheduling. In: Ninth International Conference on Project Management and Scheduling (PMS 2004) (2004)
Sebastian, P., Olaf, S., Sebastian, E.: Efficient synthesis of production schedules by optimization of timed automata. J. Control Engineering Practice 14(10), 1183–1197 (2006)
Godefroid, P., Wolper, P.: Using partial orders for the efficient verification of deadlock freedom and safety properties. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 332–342. Springer, Heidelberg (1992)
Sierra, M.R., Varela, R.: Pruning by dominance in best-first search for the job shop Scheduling problem with total flow time. J. Intelligent Manufacturing 21(1), 111–119 (2010)
Arfi, F., Ilié, J.M., Saïdouni, D.E.: Scheduling with RATA model. J. International Journal of Computer Science and Telecommunications (IJCST) 3(10), 14–20 (2012) ISSN:2047-3338
Saïdouni, D.E., Benamira, A., Belala, N., Arfi, F.: FOCOVE: Formal Concurrency Verification Environment for Complex Systems. In: Intelligent Systems and Automation (CISA 2008), Annaba, Algeria, vol. 1019 (1), pp. 375–380 (2008)
Saïdouni, D.E., Ghenaï, A. : Intégration des Refus Temporaires dans les Graphes de Refus. In : NOTERE 2006, Hermes, Toulouse, France, (2006)
Yang, S., Wang, D., Chai, T., Kendall, G.: An improved constraint satisfaction adaptive neural network for job-shop scheduling. J. Journal of Scheduling 13(1), 17–38 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Arfi, F., Ilié, JM., Saidouni, DE. (2013). Pruning Search Spaces of RATA Model for the Job-Shop Scheduling. In: Singh, K., Awasthi, A.K. (eds) Quality, Reliability, Security and Robustness in Heterogeneous Networks. QShine 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37949-9_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-37949-9_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37948-2
Online ISBN: 978-3-642-37949-9
eBook Packages: Computer ScienceComputer Science (R0)