{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:25:28Z","timestamp":1757543128785,"version":"3.37.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030289560"},{"type":"electronic","value":"9783030289577"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-28957-7_35","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T19:06:24Z","timestamp":1568228784000},"page":"421-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Event-Based Parameterized Active Scheduler for Classical Job Shop Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8847-5200","authenticated-orcid":false,"given":"Luis Carlos","family":"dos Santos J\u00fanior","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7236-2807","authenticated-orcid":false,"given":"Aparecida de F\u00e1tima","family":"Castello Rosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6075-5566","authenticated-orcid":false,"given":"Fabio Henrique","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,11]]},"reference":[{"key":"35_CR1","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-39304-4_8","volume-title":"Automated Scheduling and Planning","author":"B Akay","year":"2013","unstructured":"Akay, B., Yao, X.: Recent advances in evolutionary algorithms for job shop scheduling. In: Uyar, A., Ozcan, E., Urquhart, N. (eds.) Automated Scheduling and Planning. Studies in Computational Intelligence, vol. 505, pp. 191\u2013224. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-39304-4_8"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.cie.2015.04.006","volume":"85","author":"L Asadzadeh","year":"2015","unstructured":"Asadzadeh, L.: A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Comput. Ind. Eng. 85, 376\u2013383 (2015). \n                      https:\/\/doi.org\/10.1016\/j.cie.2015.04.006","journal-title":"Comput. Ind. Eng."},{"key":"35_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2010.04.019","author":"L Asadzadeh","year":"2010","unstructured":"Asadzadeh, L., Zamanifar, K.: An agent-based parallel approach for the job shop scheduling problem with genetic algorithms. Math. Comput. Model. (2010). \n                      https:\/\/doi.org\/10.1016\/j.mcm.2010.04.019","journal-title":"Math. Comput. Model."},{"key":"35_CR4","unstructured":"Beasley, J.: OR-Library (1990). \n                      http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/files%0A\/jobshop1.txt"},{"key":"35_CR5","series-title":"Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-1-4615-1507-4_3","volume-title":"Essays and Surveys in Metaheuristics Operations","author":"S Binato","year":"2002","unstructured":"Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C.: A grasp for job shop scheduling. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics Operations. Research\/Computer Science Interfaces Series, vol. 15, pp. 59\u201379. Springer, Boston (2002). \n                      https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_3"},{"issue":"3","key":"35_CR6","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry, I.A., Khan, A.A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551\u2013591 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"35_CR7","doi-asserted-by":"publisher","unstructured":"Gabel, T., Riedmiller, M.: Scaling adaptive agent-based reactive job-shop scheduling to large-scale problems. In: 2007 IEEE Symposium on Computational Intelligence in Scheduling, pp. 259\u2013266, April 2007. \n                      https:\/\/doi.org\/10.1109\/SCIS.2007.367699","DOI":"10.1109\/SCIS.2007.367699"},{"issue":"4","key":"35_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B Giffler","year":"1960","unstructured":"Giffler, B., Thompson, G.L.: Algorithms for solving production-scheduling problems. Oper. Res. 8(4), 487\u2013503 (1960)","journal-title":"Oper. Res."},{"issue":"1","key":"35_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"JF Goncalves","year":"2005","unstructured":"Goncalves, J.F., Mendes, J.J.M., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167(1), 77\u201395 (2005). \n                      https:\/\/doi.org\/10.1016\/j.ejor.2004.03.012","journal-title":"Eur. J. Oper. Res."},{"key":"35_CR10","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-51133-7_21","volume-title":"Advances in Production Management Systems. Initiatives for a Sustainable World","author":"F Grassi","year":"2016","unstructured":"Grassi, F., Schimit, P.H.T., Pereira, F.H.: Dynamic seed genetic algorithm to solve job shop scheduling problems. In: N\u00e4\u00e4s, I., et al. (eds.) APMS 2016. IAICT, vol. 488, pp. 170\u2013177. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-51133-7_21"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"A Jain","year":"1999","unstructured":"Jain, A., Meeran, S.: Deterministic job-shop scheduling: past, present and future. Eur. J. Oper. Res. 113(2), 390\u2013434 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"35_CR12","series-title":"Wiley Encyclopedia of Electrical and Electronics Engineering","volume-title":"Survey of Job Shop Scheduling Techniques","author":"A Jones","year":"2001","unstructured":"Jones, A., Rabelo, L.C., Sharawi, A.T.: Survey of Job Shop Scheduling Techniques. Wiley Encyclopedia of Electrical and Electronics Engineering. Wiley, London (2001)"},{"key":"35_CR13","volume-title":"Simulation with Arena","author":"DW Kelton","year":"1998","unstructured":"Kelton, D.W.: Simulation with Arena. McGraw Hill, Boston (1998)"},{"key":"35_CR14","volume-title":"Project Management: A Systems Approach to Planning, Scheduling, and Controlling","author":"H Kerzner","year":"2009","unstructured":"Kerzner, H.: Project Management: A Systems Approach to Planning, Scheduling, and Controlling, 10th edn. Wiley, Hoboken (2009)","edition":"10"},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-50137-6_7","volume-title":"Data Mining and Constraint Programming","author":"L Kotthoff","year":"2016","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O\u2019Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS (LNAI), vol. 10101, pp. 149\u2013190. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-50137-6_7"},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"PJM Laarhoven van","year":"1992","unstructured":"van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job shop scheduling by simulated annealing. Oper. Res. 40(1), 113\u2013125 (1992). \n                      https:\/\/doi.org\/10.1287\/opre.40.1.113","journal-title":"Oper. Res."},{"key":"35_CR17","unstructured":"Lawrence, S.: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). Ph.D. thesis, Graduate School of Industrial Administration, Carnegie-Mellon University (1984)"},{"issue":"6","key":"35_CR18","doi-asserted-by":"publisher","first-page":"797","DOI":"10.2307\/2634595","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manag. Sci. 42(6), 797\u2013813 (1996). \n                      https:\/\/doi.org\/10.2307\/2634595","journal-title":"Manag. Sci."},{"issue":"1","key":"35_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/B:APIN.0000027769.48098.91","volume":"21","author":"BM Ombuki","year":"2004","unstructured":"Ombuki, B.M., Ventresca, M.: Local search genetic algorithms for the job shop scheduling problem. Appl. Intell. 21(1), 99\u2013109 (2004). \n                      https:\/\/doi.org\/10.1023\/B:APIN.0000027769.48098.91","journal-title":"Appl. Intell."},{"issue":"2","key":"35_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s11047-014-9413-1","volume":"13","author":"JJ Palacios","year":"2014","unstructured":"Palacios, J.J., Gonz\u00e1lez-Rodr\u00edguez, I., Vela, C.R., Puente, J.: Robust swarm optimisation for fuzzy open shop scheduling. Nat. Comput. 13(2), 145\u2013156 (2014)","journal-title":"Nat. Comput."},{"key":"35_CR21","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-39304-4_7","volume-title":"Automated Scheduling and Planning","author":"D Petrovic","year":"2013","unstructured":"Petrovic, D., Castro, E., Petrovic, S., Kapamara, T.: Radiotherapy scheduling. In: Uyar, A., Ozcan, E., Urquhart, N. (eds.) Automated Scheduling and Planning. Studies in Computational Intelligence, vol. 505, pp. 155\u2013189. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-39304-4_7"},{"key":"35_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 4th edn. Springer, Boston (2012). \n                      https:\/\/doi.org\/10.1007\/978-1-4614-2361-4","edition":"4"},{"issue":"1","key":"35_CR23","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1504\/IJOR.2014.057848","volume":"19","author":"P Pongchairerks","year":"2014","unstructured":"Pongchairerks, P.: A self-tuning PSO for job-shop scheduling problems. Int. J. Oper. Res. 19(1), 96\u2013113 (2014)","journal-title":"Int. J. Oper. Res."},{"issue":"2","key":"35_CR24","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1504\/IJMOR.2016.077995","volume":"9","author":"P Pongchairerks","year":"2016","unstructured":"Pongchairerks, P.: Efficient local search algorithms for job-shop scheduling problems. Int. J. Math. Oper. Res. 9(2), 258\u2013277 (2016)","journal-title":"Int. J. Math. Oper. Res."},{"key":"35_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2019\/8683472","volume":"2019","author":"P Pongchairerks","year":"2019","unstructured":"Pongchairerks, P.: A two-level metaheuristic algorithm for the job-shop scheduling problem. Complexity 2019, 1\u201311 (2019)","journal-title":"Complexity"},{"issue":"4","key":"35_CR26","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1504\/IJOR.2009.023535","volume":"4","author":"P Pongchairerks","year":"2009","unstructured":"Pongchairerks, P., Kachitvichyanukul, V., et al.: A two-level particle swarm optimisation algorithm on job-shop scheduling problems. Int. J. Oper. Res. 4(4), 390\u2013411 (2009)","journal-title":"Int. J. Oper. Res."},{"issue":"10","key":"35_CR27","doi-asserted-by":"publisher","first-page":"3243","DOI":"10.1016\/j.cor.2007.02.019","volume":"35","author":"D Sha","year":"2008","unstructured":"Sha, D., Hsu, C.Y.: A new particle swarm optimization for the open shop scheduling problem. Comput. Oper. Res. 35(10), 3243\u20133261 (2008)","journal-title":"Comput. Oper. Res."},{"key":"35_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-319-74718-7_46","volume-title":"Computer Aided Systems Theory \u2013 EUROCAST 2017","author":"C Smutnicki","year":"2018","unstructured":"Smutnicki, C., Bo\u017cejko, W.: Tabu search and solution space analyses. The job shop case. In: Moreno-D\u00edaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2017. LNCS, vol. 10671, pp. 383\u2013391. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-74718-7_46"},{"issue":"10","key":"35_CR29","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"Storer, R.H., Wu, S.D., Vaccari, R.: New search spaces for sequencing problems with application to job shop scheduling. Manag. Sci. 38(10), 1495\u20131509 (1992)","journal-title":"Manag. Sci."},{"key":"35_CR30","unstructured":"Wall, M.: GAlib: a C++ library of genetic algorithm components. Mechanical Engineering Department, Massachusetts Institute of Technology (1996). \n                      https:\/\/doi.org\/citeulike-articleid:4305029\n                      \n                    . \n                      http:\/\/lancet.mit.edu\/ga\/dist\/"},{"issue":"6","key":"35_CR31","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","volume":"28","author":"L Wang","year":"2001","unstructured":"Wang, L., Zheng, D.Z.: An effective hybrid optimization strategy for job-shop scheduling problems. Comput. Oper. Res. 28(6), 585\u2013596 (2001). \n                      https:\/\/doi.org\/10.1016\/S0305-0548(99)00137-9","journal-title":"Comput. Oper. Res."},{"key":"35_CR32","unstructured":"Yamada, T.: Studies on metaheuristics for jobshop and flowshop scheduling problems. Ph.D. thesis, Kyoto University, Kyoto, Japan (2008)"}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-28957-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T19:10:42Z","timestamp":1568229042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-28957-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030289560","9783030289577"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28957-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CISIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Computer Information Systems and Industrial Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgrade","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cisim2019.wi.pb.edu.pl\/","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":"70","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":"43","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":"61% - 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":"2-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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}