{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:15:16Z","timestamp":1742919316991,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030618339"},{"type":"electronic","value":"9783030618346"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-61834-6_15","type":"book-chapter","created":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T04:33:06Z","timestamp":1602045186000},"page":"165-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Minimizing Regular Criteria in the Job-Shop Scheduling Multi-resource Resource Flexibility with Linear Routes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1757-6885","authenticated-orcid":false,"given":"Andr\u00e9s Alberto","family":"Garc\u00eda-Le\u00f3n","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5874-3091","authenticated-orcid":false,"given":"William Fernando","family":"Torres Tapia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,8]]},"reference":[{"issue":"5","key":"15_CR1","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s10845-014-0875-x","volume":"26","author":"C Zeng","year":"2014","unstructured":"Zeng, C., Tang, J., Yan, C.: Job-shop cell-scheduling problem with inter-cell moves and automated guided vehicles. J. Intell. Manuf. 26(5), 845\u2013859 (2014). https:\/\/doi.org\/10.1007\/s10845-014-0875-x","journal-title":"J. Intell. Manuf."},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369\u2013375 (1990)","journal-title":"Computing"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ijpe.2014.03.006","volume":"153","author":"A Rossi","year":"2014","unstructured":"Rossi, A.: Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships. Int. J. Prod. Econ. 153, 253\u2013267 (2014)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.ejor.2017.04.050","volume":"263","author":"S Knopp","year":"2017","unstructured":"Knopp, S., Dauz\u00e8re-P\u00e9r\u00e8s, S., Yugma, C.: A batch-oblivious approach for complex job-shop scheduling problems. Eur. J. Oper. Res. 263(1), 50\u201361 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Mati, Y., Rezg, N., Xie, X.: An integrated greedy heuristic for a flexible job shop scheduling problem. In: 2001 IEEE International Conference on Systems, Man, and Cybernetics, vol. 4, pp. 2534\u20132539. IEEE (2001)","DOI":"10.1109\/ICSMC.2001.972939"},{"issue":"8","key":"15_CR6","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1080\/00207541003733775","volume":"49","author":"Y Mati","year":"2011","unstructured":"Mati, Y., Lahlou, C., Dauz\u00e8re-P\u00e9r\u00e8s, S.: Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints. Int. J. Prod. Res. 49(8), 2169\u20132182 (2011)","journal-title":"Int. J. Prod. Res."},{"issue":"16","key":"15_CR7","doi-asserted-by":"publisher","first-page":"5278","DOI":"10.1080\/00207543.2018.1467575","volume":"56","author":"T Meng","year":"2018","unstructured":"Meng, T., Pan, Q.-K., Sang, H.-Y.: A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations. Int. J. Prod. Res. 56(16), 5278\u20135292 (2018)","journal-title":"Int. J. Prod. Res."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.cor.2014.08.023","volume":"54","author":"JJ Palacios","year":"2015","unstructured":"Palacios, J.J., Gonz\u00e1lez, M.A., Vela, C.R., Gonz\u00e1lez-Rodr\u00edguez, I., Puente, J.: Genetic tabu search for the fuzzy flexible job-shop problem. Comput. Oper. Res. 54, 74\u201389 (2015)","journal-title":"Comput. Oper. Res."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.cie.2016.10.019","volume":"106","author":"FE Khoukhi","year":"2017","unstructured":"Khoukhi, F.E., Boukachour, J., Alaoui, A.E.H.: The dual-ants colony: a novel hybrid approach for the flexible job-shop scheduling problem with preventive maintenance. Comput. Ind. Eng. 106, 236\u2013255 (2017)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0377-2217(97)00341-X","volume":"107","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1998","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Roux, W., Lasserre, J.: Multi-resource shop scheduling with resource flexibility. Eur. J. Oper. Res. 107(2), 289\u2013305 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1109\/TSMCC.2003.814036","volume":"33","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2003","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Pavageau, C.: Extensions of an integrated approach for multi-resource shop scheduling. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 33(2), 207\u2013213 (2003)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C Appl. Rev."},{"key":"15_CR12","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, 551\u2013591 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cor.2019.04.012","volume":"108","author":"AA Garc\u00eda-Le\u00f3n","year":"2019","unstructured":"Garc\u00eda-Le\u00f3n, A.A., Dauz\u00e8re-P\u00e9r\u00e8s, S., Mati, Y.: An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Comput. Oper. Res. 108, 187\u2013200 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ejor.2011.01.046","volume":"212","author":"Y Mati","year":"2011","unstructured":"Mati, Y., Dauz\u00e8re-P\u00e9r\u00e8s, S., Lahlou, C.: A general approach for optimizing regular criteria in the job-shop scheduling problem. Eur. J. Oper. Res. 212(1), 33\u201342 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR15","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-030-31019-6_64","volume-title":"Applied Computer Sciences in Engineering","author":"AA Garc\u00eda-Le\u00f3n","year":"2019","unstructured":"Garc\u00eda-Le\u00f3n, A.A., Torres Tapia, W.F.: A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem Multi-resource Resource Flexibility with Linear Routes. In: Figueroa-Garc\u00eda, J.C., Duarte-Gonz\u00e1lez, M., Jaramillo-Isaza, S., Orjuela-Ca\u00f1on, A.D., D\u00edaz-Gutierrez, Y. (eds.) WEA 2019. CCIS, vol. 1052, pp. 764\u2013775. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31019-6_64"},{"issue":"2","key":"15_CR16","first-page":"109","volume":"30","author":"M Singer","year":"1998","unstructured":"Singer, M., Pinedo, M.: A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Trans. 30(2), 109\u2013118 (1998)","journal-title":"IIE Trans."}],"container-title":["Communications in Computer and Information Science","Applied Computer Sciences in Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61834-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T16:23:55Z","timestamp":1723739035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-61834-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030618339","9783030618346"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61834-6_15","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Engineering Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bogota","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2020","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":"woea2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ieee.udistrital.edu.co\/wea2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"136","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":"32","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":"12","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":"24% - 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.68","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.41","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)"}},{"value":"Due to the COVID-19 pandemic the conference was held online","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}