{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:18:03Z","timestamp":1743135483712,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031064579"},{"type":"electronic","value":"9783031064586"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06458-6_21","type":"book-chapter","created":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T15:07:58Z","timestamp":1652368078000},"page":"254-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hospital Room Management for Covid-19 Patients Using Petri Nets"],"prefix":"10.1007","author":[{"given":"Ayoub","family":"El Bazzazi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bouchra","family":"El Akraoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelhadi","family":"Larach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,13]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1016\/j.egypro.2012.02.128","volume":"17","author":"Q Wang","year":"2012","unstructured":"Wang, Q., Wang, Z.: Hybrid heuristic search based on Petri net for MS scheduling. Energy Procedia 17, 506\u2013512 (2012)","journal-title":"Energy Procedia"},{"doi-asserted-by":"crossref","unstructured":"Chang, Y., Lin, C., Tsain, J., Hing, C.T.: Infection control measure of a Taiwanes hospital to confront the Covid_19 pandamic. Med. Sci. 19 (2020)","key":"21_CR2","DOI":"10.1002\/kjm2.12228"},{"doi-asserted-by":"crossref","unstructured":"Lei, H., Xing, K., Han, L., Xiong, F., Ge, Z.: Deadlock-free scheduling for flexible manufacturing systems using Petri nets and heuristic search. Comput. Ind. Eng. 72, 297\u2013305 (2014)","key":"21_CR3","DOI":"10.1016\/j.cie.2014.04.002"},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/66.705373","volume":"11","author":"HH Xiong","year":"1998","unstructured":"Xiong, H.H., Zhou, M.: Scheduling of semiconductor test facility via Petri nets and hybrid heuristic search. IEEE Trans. Semicond. Manuf. 11(3), 384\u2013393 (1998)","journal-title":"IEEE Trans. Semicond. Manuf."},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1008097430956","volume":"10","author":"MD Jeng","year":"1998","unstructured":"Jeng, M.D., Chen, S.C.: Heuristic search approach using approximate solutions to Petri net state equations for scheduling flexible manufacturing systems. Int. J. Flexible Manuf. Syst. 10(2), 139\u2013162 (1998)","journal-title":"Int. J. Flexible Manuf. Syst."},{"issue":"6","key":"21_CR6","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.rcim.2004.12.002","volume":"21","author":"W Zhang","year":"2005","unstructured":"Zhang, W., Freiheit, T., Yang, H.: Dynamic scheduling in a flexible assembly system based on a timed Petri nets model. Robot. Comput. Integr. Manuf. 21(6), 550\u2013558 (2005)","journal-title":"Robot. Comput. Integr. Manuf."},{"doi-asserted-by":"crossref","unstructured":"Mej\u00eda, G., Caballero-Villalobos, J.P., Montoya, C.: Petri nets and deadlock-free scheduling of open shop manufacturing systems. IEEE Trans. Syst. Man, Cybern. Syst. 48(6), 1017\u20131028 (2018)","key":"21_CR7","DOI":"10.1109\/TSMC.2017.2707494"},{"doi-asserted-by":"crossref","unstructured":"Mej\u00edaand, G., Ni\u00f1o, K.: Anew Hybrid Filtered Beam Search Algorithm for deadlock-free scheduling of flexible manufacturing systems using Petri nets. Comput. Ind. Eng. 108, 165\u2013176 (2017)","key":"21_CR8","DOI":"10.1016\/j.cie.2017.04.034"},{"doi-asserted-by":"crossref","unstructured":"Pan, L., Ding, Z.J., Zhou, M.C.: A configurable state class method for temporal analysis of time Petri nets. IEEE Trans. Syst. Man Cybern. Syst. 44(4), 482\u2013493 (2014)","key":"21_CR9","DOI":"10.1109\/TSMC.2013.2258907"},{"doi-asserted-by":"crossref","unstructured":"Zhu, Q., Zhou, M., Qiao, Y., Wu, N.: Petri net modelling and scheduling of a close-down process for time-constrained single-arm cluster tools. IEEE Trans. Syst. Man Cybern. Syst. 48(3), 389\u2013400 (2018)","key":"21_CR10","DOI":"10.1109\/TSMC.2016.2598303"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/B:OPTE.0000013633.35184.6d","volume":"5","author":"A Tarek","year":"2004","unstructured":"Tarek, A., Lopez-Benitez, N.: Optimal legal firing sequence of Petri nets using linear programming. Optim. Eng. 5(1), 25\u201343 (2004)","journal-title":"Optim. Eng."},{"doi-asserted-by":"crossref","unstructured":"Hu, H., Su, R., Zhou, M., Liu, Y.: Polynomially complex synthesis of distributed supervisors for large-scale AMSs using Petri Nets. IEEE Trans. Control Syst. Tech. 24(5), 1\u201313 (2015)","key":"21_CR12","DOI":"10.1109\/TCST.2015.2504046"},{"issue":"7","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1109\/TAC.2014.2363311","volume":"60","author":"D Lefebvre","year":"2015","unstructured":"Lefebvre, D., Leclercq, E.: Control design for trajectory tracking with untimed Petri nets. IEEE Trans. Autom. Control 60(7), 1921\u20131926 (2015)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1109\/TASE.2015.2467165","volume":"13","author":"D Lefebvre","year":"2016","unstructured":"Lefebvre, D.: Approaching minimal time control sequences for timed Petri nets. IEEE Trans. Autom. Sci. Eng. 13(2), 1215\u20131221 (2016)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"doi-asserted-by":"crossref","unstructured":"de Albuquerque, G.A., Maciel, P., Lima, R.M.F., Magnani, F.: Strategic and tactical evaluation of conflicting environment and business goals in green supply chains. IEEE Trans. Syst. Man Cybern. Syst. 43(5), 1013\u20131027 (2013)","key":"21_CR15","DOI":"10.1109\/TSMCA.2012.2227311"},{"issue":"4","key":"21_CR16","first-page":"28","volume":"27","author":"D Lefebvre","year":"2017","unstructured":"Lefebvre, D., Daoui, C.: Control design for untimed Petri nets using Markov decision processes. J. Oper. Res. Decis. 27(4), 28\u201343 (2017)","journal-title":"J. Oper. Res. Decis."},{"unstructured":"Berthomieu, B., Menasche, M.: An enumerative approach for analysing time Petri nets. In: Proceedings of IFIP Congress, pp. 41\u201346 (1983)","key":"21_CR17"},{"doi-asserted-by":"publisher","unstructured":"Berthomieu, B., Vernadat, F.: State class constructions for branching analysis of time Petri Nets. In: Garavel, H., Hatcliff, J. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2003. Lecture Notes in Computer Science, vol. 2619. Springer, Berlin (2003). https:\/\/doi.org\/10.1007\/3-540-36577-X_33","key":"21_CR18","DOI":"10.1007\/3-540-36577-X_33"},{"unstructured":"Gardey, G., Roux, O.H., Roux, O.F.: Using Zone graph method for computing the state space of a time Petri net. In Formal Modelling and Analysis of Timed Systems (2000)","key":"21_CR19"},{"doi-asserted-by":"crossref","unstructured":"Wu et Wu, S.D., Storer, R.H., Chang, P.C.: One machine rescheduling heuristics with efficiency and stability as criteria. Comput. Oper. Res. 20, 1\u201314 (1993)","key":"21_CR20","DOI":"10.1016\/0305-0548(93)90091-V"},{"unstructured":"Lube, J., Awel, D., Mogga, J.: 17 merch 2021 COVID-19 case management strategies: what are the options for Africa. Infectious Diseases of poverty. N 30(2021). 17 Mar 2021","key":"21_CR21"}],"container-title":["Lecture Notes in Business Information Processing","Business Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06458-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:31:31Z","timestamp":1710329491000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06458-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031064579","9783031064586"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06458-6_21","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Business Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Khouribga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbi2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cbi-bm.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}