{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T22:40:05Z","timestamp":1756593605100,"version":"3.44.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030858735"},{"type":"electronic","value":"9783030858742"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-85874-2_42","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T17:02:37Z","timestamp":1630429357000},"page":"399-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-objective Genetic Algorithm to\u00a0Reduce Setup Waste in a Single Machine with Coupled-Tasks Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Corentin","family":"Le Hesran","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4201-4430","authenticated-orcid":false,"given":"Anne-Laure","family":"Ladier","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2565-6690","authenticated-orcid":false,"given":"Val\u00e9rie","family":"Botta-Genoulaz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,31]]},"reference":[{"issue":"1","key":"42_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1080\/00207543.2016.1205235","volume":"55","author":"K Amrouche","year":"2017","unstructured":"Amrouche, K., Boudhar, M., Bendraouche, M., Yalaoui, F.: Chain-reentrant shop with an exact time lag: new results. Int. J. Prod. Res. 55(1), 285\u2013295 (2017)","journal-title":"Int. J. Prod. Res."},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Blasco, X., Herrero, J.M., Sanchis, J., Mart\u00ednez, M.: A new graphical visualization of n-dimensional Pareto front for decision-making in multiobjective optimization. Inf. Sci. 178(20), 3908\u20133924 (2008)","DOI":"10.1016\/j.ins.2008.06.010"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Blazewicz, J., Pawlak, G., Tanas, M., Wojciechowicz, W.: New algorithms for coupled tasks scheduling: a survey. RAIRO - Oper. Res. 46(4), 335\u2013353 (2012)","DOI":"10.1051\/ro\/2012020"},{"issue":"16\u201317","key":"42_CR4","doi-asserted-by":"publisher","first-page":"2370","DOI":"10.1016\/j.dam.2012.05.026","volume":"160","author":"A Condotta","year":"2012","unstructured":"Condotta, A., Shakhlevich, N.V.: Scheduling coupled-operation jobs with exact time-lags. Discrete Appl. Math. 160(16\u201317), 2370\u20132388 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"42_CR5","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.ejor.2016.10.012","volume":"259","author":"B Courtad","year":"2017","unstructured":"Courtad, B., Baker, K., Magazine, M., Polak, G.: Minimizing flowtime for paired tasks. Eur. J. Oper. Res. 259(3), 818\u2013828 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/3-540-45356-3_83","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"K Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849\u2013858. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45356-3_83"},{"issue":"2","key":"42_CR7","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."},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jmsy.2015.08.002","volume":"37","author":"A Giret","year":"2015","unstructured":"Giret, A., Trentesaux, D., Prabhu, V.: Sustainability in manufacturing operations scheduling: a state of the art review. J. Manuf. Syst. 37, 126\u2013140 (2015)","journal-title":"J. Manuf. Syst."},{"issue":"1","key":"42_CR9","first-page":"55","volume":"32","author":"O Gould","year":"2015","unstructured":"Gould, O., Colwill, J.: A framework for material flow assessment in manufacturing systems. J. Ind. Prod. Eng. 32(1), 55\u201366 (2015)","journal-title":"J. Ind. Prod. Eng."},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"7130","DOI":"10.1080\/00207543.2019.1693653","volume":"58","author":"C Le Hesran","year":"2019","unstructured":"Le Hesran, C., Agarwal, A., Ladier, A.L., Botta-Genoulaz, V., Laforest, V.: Reducing waste in manufacturing operations: bi-objective scheduling on a single-machine with coupled-tasks. Int. J. Prod. Res. 58, 7130\u20137148 (2019)","journal-title":"Int. J. Prod. Res."},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"119023","DOI":"10.1016\/j.jclepro.2019.119023","volume":"246","author":"C Le Hesran","year":"2019","unstructured":"Le Hesran, C., Ladier, A.L., Botta-Genoulaz, V., Laforest, V.: A methodology for the identification of waste-minimizing scheduling problems. J. Cleaner Prod. 246, 119023 (2019)","journal-title":"J. Cleaner Prod."},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Li, H., Zhao, H.: Scheduling coupled-tasks on a single machine. In: Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, pp. 137\u2013142 (2007)","DOI":"10.1109\/SCIS.2007.367681"},{"issue":"1","key":"42_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1504\/EJIE.2018.089877","volume":"12","author":"N Meziani","year":"2018","unstructured":"Meziani, N., Boudhar, M., Oulamara, A.: PSO and simulated annealing for the two-machine flowshop scheduling problem with coupled-operations. Eur. J. Ind. Eng. 12(1), 43\u201366 (2018)","journal-title":"Eur. J. Ind. Eng."},{"issue":"96","key":"42_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(96)00041-8","volume":"72","author":"AJ Orman","year":"1997","unstructured":"Orman, A.J., Potts, C.: On the complexity of coupled-task scheduling. Discrete Appl. Math. 72(96), 141\u2013154 (1997)","journal-title":"Discrete Appl. Math."},{"key":"42_CR15","unstructured":"Portmann, M.C.: Genetic algorithms and scheduling: a state of the art and some propositions. In: Proceedings of the Workshop on Production Planning and Control, vo. 9, no. 11, pp. 1\u201324 (1996)"},{"issue":"2","key":"42_CR16","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/S0377-2217(02)00827-5","volume":"151","author":"M Sevaux","year":"2003","unstructured":"Sevaux, M., Dauz\u00e8re-P\u00e9r\u00e8s, S.: Genetic algorithms to minimize the weighted number of late jobs on a single machine. Eur. J. Oper. Res. 151(2), 296\u2013306 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"42_CR17","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/nav.3800270312","volume":"27","author":"RD Shapiro","year":"1980","unstructured":"Shapiro, R.D.: Scheduling coupled tasks. Naval Res. Logistics Q. 27(3), 489\u2013498 (1980)","journal-title":"Naval Res. Logistics Q."}],"container-title":["IFIP Advances in Information and Communication Technology","Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85874-2_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T22:03:35Z","timestamp":1756591415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85874-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030858735","9783030858742"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85874-2_42","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Advances in Production Management Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nantes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apms2021","order":10,"name":"conference_id","label":"Conference ID","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":"Conftool","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"529","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":"378","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":"71% - 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.2","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.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)"}},{"value":"The conference was held virtually.","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)"}}]}}