{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:36:34Z","timestamp":1760441794218,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031371073"},{"type":"electronic","value":"9783031371080"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-37108-0_32","type":"book-chapter","created":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T04:01:42Z","timestamp":1688097702000},"page":"495-507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Multi-objective Optimization of\u00a0the\u00a0Job Shop Scheduling Problem on\u00a0Unrelated Parallel Machines with Sequence-Dependent Setup Times"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8621-615X","authenticated-orcid":false,"given":"Francisco","family":"dos Santos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4772-4404","authenticated-orcid":false,"given":"Lino","family":"Costa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2299-1859","authenticated-orcid":false,"given":"Leonilde","family":"Varela","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,1]]},"reference":[{"issue":"12","key":"32_CR1","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.4236\/jsea.2010.312135","volume":"3","author":"TF Abdelmaguid","year":"2010","unstructured":"Abdelmaguid, T.F.: Representations in genetic algorithm for the job shop scheduling problem: a computational study. J. Softw. Eng. Appl. 3(12), 1155 (2010)","journal-title":"J. Softw. Eng. Appl."},{"issue":"14","key":"32_CR2","doi-asserted-by":"publisher","first-page":"2431","DOI":"10.3390\/math10142431","volume":"10","author":"AR Antunes","year":"2022","unstructured":"Antunes, A.R., Matos, M.A., Rocha, A.M.A., Costa, L.A., Varela, L.R.: A statistical comparison of metaheuristics for unrelated parallel machine scheduling problems with setup times. Mathematics 10(14), 2431 (2022)","journal-title":"Mathematics"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10845-012-0672-3","volume":"25","author":"JP Arnaout","year":"2014","unstructured":"Arnaout, J.P., Musa, R., Rabadi, G.: A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines-part II: enhancements and experimentations. J. Intell. Manuf. 25, 43\u201353 (2014)","journal-title":"J. Intell. Manuf."},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"89497","DOI":"10.1109\/ACCESS.2020.2990567","volume":"8","author":"J Blank","year":"2020","unstructured":"Blank, J., Deb, K.: Pymoo: multi-objective optimization in python. IEEE Access 8, 89497\u201389509 (2020)","journal-title":"IEEE Access"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF02823145","volume":"24","author":"K Deb","year":"1999","unstructured":"Deb, K.: An introduction to genetic algorithms. Sadhana 24, 293\u2013315 (1999)","journal-title":"Sadhana"},{"issue":"2","key":"32_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"unstructured":"Feldman, A.: Scheduling algorithms and systems. Columbia University (1999)","key":"32_CR7"},{"key":"32_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106026","volume":"137","author":"EM Gonz\u00e1lez-Neira","year":"2019","unstructured":"Gonz\u00e1lez-Neira, E.M., et al.: Robust solutions in multi-objective stochastic permutation flow shop problem. Comput. Industr. Eng. 137, 106026 (2019)","journal-title":"Comput. Industr. Eng."},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch, S., Chauhan, S.S., Kumar, V.: A review on genetic algorithm: past, present, and future. Multimed. Tools Appl. 80, 8091\u20138126 (2021)","journal-title":"Multimed. Tools Appl."},{"doi-asserted-by":"crossref","unstructured":"Khan, B., Hanoun, S., Johnstone, M., Lim, C.P., Creighton, D., Nahavandi, S.: Multi-objective job shop scheduling using I-NSGA-III. In: 2018 Annual IEEE International Systems Conference (SysCon), pp. 1\u20135. IEEE (2018)","key":"32_CR10","DOI":"10.1109\/SYSCON.2018.8369558"},{"key":"32_CR11","volume-title":"Applied Statistics and Probability for Engineers","author":"DC Montgomery","year":"2010","unstructured":"Montgomery, D.C., Runger, G.C.: Applied Statistics and Probability for Engineers. Wiley, Hoboken (2010)"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00170-005-0375-4","volume":"32","author":"M Saidi-Mehrabad","year":"2007","unstructured":"Saidi-Mehrabad, M., Fattahi, P.: Flexible job shop scheduling with tabu search algorithms. Int. J. Adv. Manuf. Technol. 32, 563\u2013570 (2007)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-031-10562-3_12","volume-title":"Computational Science and Its Applications - ICCSA 2022 Workshops","author":"F dos Santos","year":"2022","unstructured":"dos Santos, F., Costa, L.A., Varela, L.: A systematic literature review about multi-objective optimization for distributed manufacturing scheduling in the industry 4.0. In: Gervasi, O., Murgante, B., Misra, S., Rocha, A.M.A.C., Garau, C. (eds.) ICCSA 2022, Part II. LNCS, vol. 13378, pp. 157\u2013173. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-10562-3_12"},{"issue":"2","key":"32_CR14","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/j.eswa.2009.06.041","volume":"37","author":"D Sha","year":"2010","unstructured":"Sha, D., Lin, H.H.: A multi-objective PSO for job-shop scheduling problems. Expert Syst. Appl. 37(2), 1065\u20131070 (2010)","journal-title":"Expert Syst. Appl."},{"doi-asserted-by":"crossref","unstructured":"Soto, C., Dorronsoro, B., Fraire, H., Cruz-Reyes, L., Gomez-Santillan, C., Rangel, N.: Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm. Swarm Evol. Comput. 53, 100632 (2020)","key":"32_CR15","DOI":"10.1016\/j.swevo.2019.100632"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.omega.2013.07.004","volume":"45","author":"MM Yenisey","year":"2014","unstructured":"Yenisey, M.M., Yagmahan, B.: Multi-objective permutation flow shop scheduling problem: literature review, classification and current trends. Omega 45, 119\u2013135 (2014)","journal-title":"Omega"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","volume":"30","author":"J Zhang","year":"2019","unstructured":"Zhang, J., Ding, G., Zou, Y., Qin, S., Fu, J.: Review of job shop scheduling research and its new perspectives under industry 4.0. J. Intell. Manuf. 30, 1809\u20131830 (2019)","journal-title":"J. Intell. Manuf."},{"issue":"2","key":"32_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2023 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37108-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T06:06:48Z","timestamp":1688105208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37108-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031371073","9783031371080"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37108-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","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":"Custom based on Cyberchair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"283","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":"67","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":"13","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.5","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":"8,5","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)"}},{"value":"PHD Showcase Papers: 6(for main conf) \/ For ICCSA 2023 Workshops 876 subm sent, 350 full papers and 29 short papers accepted, additional PHD Showcase Papers: 2","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)"}}]}}