Abstract
In flexible manufacturing system (FMS) scheduling problems, the production process and constraints can be modeled by Petri nets concisely. However, the search space for an optimal or suboptimal schedule will exponentially grow with the increase of problem size. In this paper, we consider the scheduling problems of FMS in the framework of timed-transition Petri nets. In the framework, each token owns a individual timestamp which faciliates the analysis of the concurrency characteristic of modeled system. To save search effort, we provide an admissible heuristic function which also considers the available time of shared machine resources and subparts during calculating the lower bound of the remaining time for unprocessed operations. We prove the heuristic function is more effective than prior ones. Thus, an optimal scheduling strategy can be obtained at much less effort. Several numerical experiments are provided to demonstrate the effect of the improved heuristic function.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bouffard, V., & Ferland, J. A. (2007). Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem. Journal of Scheduling, 10(6), 375–386.
Gao, J., Gen, M., & Sun, L. (2006). Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. Journal of Intelligent Manufacturing, 17(4), 493–507.
Gholami, M., & Zandieh, M. (2009). Integrating simulation and genetic algorithm to schedule a dynamic flexible job shop. Journal of Intelligent Manufacturing, 20(4), 481–498.
Huang, B., Jiang, R., & Zhang, G. (2014). Search strategy for scheduling flexible manufacturing systems simultaneously using admissible heuristic functions and nonadmissible heuristic functions. Computers & Industrial Engineering, 71, 21–26.
Huang, B., Sun, Y., & Sun, Y. M. (2008). Scheduling of flexible manufacturing systems based on petri nets and hybrid heuristic search. International Journal of Production Research, 46(16), 4553– 4565.
Ingimundardottir, H., & Runarsson, T.P.: Supervised learning linear priority dispatch rules for job-shop scheduling. In: Learning and intelligent optimization (pp. 263–277). Berlin: Springer (2011)
Jeng, M., & Chen, S. (1998). A heuristic search approach using approximate solutions to petri net state equations for scheduling flexible manufacturing systems. International Journal of Flexible Manufacturing Systems, 10(2), 139–162.
Jeng, M., Lin, C., & Huang, Y. (1999). Petri net dynamics-based scheduling of flexible manufacturing systems with assembly. Journal of Intelligent Manufacturing, 10(6), 541–555.
Lee, D. Y., & DiCesare, F. (1994). Scheduling flexible manufacturing systems using petri nets and heuristic search. Robotics and Automation, IEEE Transactions on, 10(2), 123–132.
Lee, J., & Lee, J. S. (2010). Heuristic search for scheduling flexible manufacturing systems using lower bound reachability matrix. Computers & Industrial Engineering, 59(4), 799–806.
Murata, T. (1989). Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4), 541–580.
Oguz, C., & Ercan, M. (2005). A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Journal of Scheduling, 8(4), 323–351.
Özgüven, C., Özbakır, L., & Yavuz, Y. (2010). Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Applied Mathematical Modelling, 34(6), 1539–1548.
Pearl, J. (1984). Heuristics: Intelligent search strategies for computer problem solving. Reading, Massachusetts: Addison-Wesley Publishing Company.
Piera, M., & Music, G. (2011). Coloured petri net scheduling models: Timed state space exploration shortages. Mathematics and Computers in Simulation, 82(3), 428–441.
Tuncel, G., & Bayhan, G. (2007). Applications of petri nets in production scheduling: A review. The International Journal of Advanced Manufacturing Technology, 34(7–8), 762–773.
Tzafestas, S., & Triantafyllakis, A. (1993). Deterministic scheduling in computing and manufacturing systems: A survey of models and algorithms. Mathematics and Computers in Simulation, 35(5), 397–434.
Xiong, H. H., & Zhou, M. (1998). Scheduling of semiconductor test facility via petri nets and hybrid heuristic search. Semiconductor Manufacturing, IEEE Transactions on, 11(3), 384–393.
Yu, H., Reyes, A., Cang, S., & Lloyd, S. (2003). Combined petri net modelling and AI-based heuristic hybrid search for flexible manufacturing systems—part 1. Petri net modelling and heuristic search. Computers & Industrial Engineering, 44(4), 527–543.
Yu, H., Reyes, A., Cang, S., & Lloyd, S. (2003). Combined petri net modelling and AI-based heuristic hybrid search for flexible manufacturing systems—part ii. Heuristic hybrid search. Computers & Industrial Engineering, 44(4), 545–566.
Zhou, M. (1998). Modeling, analysis, simulation, scheduling, and control of semiconductor manufacturing systems: A petri net approach. IEEE Transactions on Semiconductor Manufacturing, 11(3), 333–357.
Acknowledgments
The authors acknowledge the support of the 973 Program of China (No. 2012CB720500), the National Key Technology R&D programs of China (2014AA041805) and the National Natural Science Foundation of China under Grant 61374066.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Li, C., Wu, W., Feng, Y. et al. Scheduling FMS problems with heuristic search function and transition-timed Petri nets. J Intell Manuf 26, 933–944 (2015). https://doi.org/10.1007/s10845-014-0943-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-014-0943-2