{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:29:08Z","timestamp":1759667348086,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:00:00Z","timestamp":1593043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,25]]},"DOI":"10.1145\/3377930.3390207","type":"proceedings-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T19:29:12Z","timestamp":1593458952000},"page":"228-235","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Just-in-time batch scheduling subject to batch size"],"prefix":"10.1145","author":[{"given":"Sergey","family":"Polyakovskiy","sequence":"first","affiliation":[{"name":"Deakin University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dhananjay","family":"Thiruvady","sequence":"additional","affiliation":[{"name":"Deakin University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rym","family":"M'Hallah","sequence":"additional","affiliation":[{"name":"Kuwait University, Kuwait"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2014.01.004"},{"volume-title":"Proceedings of HM 2016 - 10th International Workshop on Hybrid Metaheuristics (Lecture Notes in Computer Science), M. J. Blesa, C. Blum, A. Cangelosi, V. Cutello, A. G. Di Nuovo, M. Pavone, and E.-G","author":"Blum C.","key":"e_1_3_2_1_2_1","unstructured":"C. Blum . 2016. Construct, Merge , Solve and Adapt: Application to Unbalanced Minimum Common String Partition . In Proceedings of HM 2016 - 10th International Workshop on Hybrid Metaheuristics (Lecture Notes in Computer Science), M. J. Blesa, C. Blum, A. Cangelosi, V. Cutello, A. G. Di Nuovo, M. Pavone, and E.-G . Talbi (Eds.), Vol. 9668 . Springer Berlin Heidelberg , 17--31. C. Blum. 2016. Construct, Merge, Solve and Adapt: Application to Unbalanced Minimum Common String Partition. In Proceedings of HM 2016 - 10th International Workshop on Hybrid Metaheuristics (Lecture Notes in Computer Science), M. J. Blesa, C. Blum, A. Cangelosi, V. Cutello, A. G. Di Nuovo, M. Pavone, and E.-G. Talbi (Eds.), Vol. 9668. Springer Berlin Heidelberg, 17--31."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of EvoCOP 2016 - 16th European Conference on Evolutionary Computation in Combinatorial Optimization (Lecture Notes in Computer Science), F. Chicano and B. Hu (Eds.)","volume":"9595","author":"Blum C.","unstructured":"C. Blum and M. J. Blesa . 2016. Construct, Merge, Solve & Adapt: Application to the Repetition-free Longest Common Subsequence Problem . In Proceedings of EvoCOP 2016 - 16th European Conference on Evolutionary Computation in Combinatorial Optimization (Lecture Notes in Computer Science), F. Chicano and B. Hu (Eds.) , Vol. 9595 . Springer Berlin Heidelberg, 46--57. C. Blum and M. J. Blesa. 2016. Construct, Merge, Solve & Adapt: Application to the Repetition-free Longest Common Subsequence Problem. In Proceedings of EvoCOP 2016 - 16th European Conference on Evolutionary Computation in Combinatorial Optimization (Lecture Notes in Computer Science), F. Chicano and B. Hu (Eds.), Vol. 9595. Springer Berlin Heidelberg, 46--57."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2873828.2874036"},{"volume-title":"Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO '12)","author":"Peter","key":"e_1_3_2_1_5_1","unstructured":"Peter A.N. Bosman and Dirk Thierens. 2012. Linkage Neighbors, Optimal Mixing and Forced Improvements in Genetic Algorithms . In Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO '12) . Association for Computing Machinery, New York, NY, USA, 585\u00e2\u0102\u015e592. Peter A.N. Bosman and Dirk Thierens. 2012. Linkage Neighbors, Optimal Mixing and Forced Improvements in Genetic Algorithms. In Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO '12). Association for Computing Machinery, New York, NY, USA, 585\u00e2\u0102\u015e592."},{"volume-title":"Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation (GECCO '13)","author":"Peter","key":"e_1_3_2_1_6_1","unstructured":"Peter A.N. Bosman and Dirk Thierens. 2013. More Concise and Robust Linkage Learning by Filtering and Combining Linkage Hierarchies . In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation (GECCO '13) . Association for Computing Machinery, New York, NY, USA, 359\u00e2\u0102\u015e366. Peter A.N. Bosman and Dirk Thierens. 2013. More Concise and Robust Linkage Learning by Filtering and Combining Linkage Hierarchies. In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation (GECCO '13). Association for Computing Machinery, New York, NY, USA, 359\u00e2\u0102\u015e366."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-018-0080-1"},{"key":"e_1_3_2_1_8_1","volume-title":"Methodology, Technology","author":"Chircop PA","year":"2018","unstructured":"PA Chircop and TJ Surendonk . 2018. Constraint programming heuristics and software tools for amphibious embarkation planning. Journal of Defense Modeling and Simulation: Applications , Methodology, Technology ( 2018 ), 1--22. PA Chircop and TJ Surendonk. 2018. Constraint programming heuristics and software tools for amphibious embarkation planning. Journal of Defense Modeling and Simulation: Applications, Methodology, Technology (2018), 1--22."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"M. Dorigo and T. St\u00fctzle. 2004. Ant Colony Optimization. MIT Press Cambridge Massachusetts USA.  M. Dorigo and T. St\u00fctzle. 2004. Ant Colony Optimization. MIT Press Cambridge Massachusetts USA.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.07.002"},{"key":"e_1_3_2_1_11_1","volume-title":"Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques. Optimization and Engineering 3, 3 (01","author":"Grossmann Ignacio E.","year":"2002","unstructured":"Ignacio E. Grossmann . 2002. Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques. Optimization and Engineering 3, 3 (01 Sep 2002 ), 227--252. Ignacio E. Grossmann. 2002. Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques. Optimization and Engineering 3, 3 (01 Sep 2002), 227--252."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1289-9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.11.015"},{"volume-title":"Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing)","author":"Lozano Jose A.","key":"e_1_3_2_1_14_1","unstructured":"Jose A. Lozano , Pedro Larra\u00f1aga , I\u00f1aki Inza , and Endika Bengoetxea . 2006. Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) . Springer-Verlag , Berlin, Heidelberg . Jose A. Lozano, Pedro Larra\u00f1aga, I\u00f1aki Inza, and Endika Bengoetxea. 2006. Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing). Springer-Verlag, Berlin, Heidelberg."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00209"},{"key":"e_1_3_2_1_16_1","unstructured":"R. M'Hallah and A. Alhajraf. 2016. Ant Colony Optimization for the Single Machine Total Earliness Tardiness Scheduling Problem. In New Frontiers in Applied Artificial Intelligence - IEA\/AIE 2008 (Lecture Notes in Computer Science) N. T. Nguyen L. Borzemski A. Grzech and M. Ali (Eds.) Vol. 5027. Springer Berlin Heidelberg 17--31.  R. M'Hallah and A. Alhajraf. 2016. Ant Colony Optimization for the Single Machine Total Earliness Tardiness Scheduling Problem. In New Frontiers in Applied Artificial Intelligence - IEA\/AIE 2008 (Lecture Notes in Computer Science) N. T. Nguyen L. Borzemski A. Grzech and M. Ali (Eds.) Vol. 5027. Springer Berlin Heidelberg 17--31."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-015-0429-x"},{"volume-title":"Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence)","author":"Pelikan Martin","key":"e_1_3_2_1_18_1","unstructured":"Martin Pelikan , Kumara Sastry , and Erick Cant\u00fa-Paz . 2006. Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence) . Springer-Verlag , Berlin, Heidelberg . Martin Pelikan, Kumara Sastry, and Erick Cant\u00fa-Paz. 2006. Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence). Springer-Verlag, Berlin, Heidelberg."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071223"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.03.042"},{"volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '18)","author":"Thierens Dirk","key":"e_1_3_2_1_21_1","unstructured":"Dirk Thierens and Peter A. N . 2018. Model-Based Evolutionary Algorithms: GECCO 2018 Tutorial . In Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '18) . Association for Computing Machinery, New York, NY, USA, 553\u00e2\u0102\u015e583. Dirk Thierens and Peter A. N. 2018. Model-Based Evolutionary Algorithms: GECCO 2018 Tutorial. In Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '18). Association for Computing Machinery, New York, NY, USA, 553\u00e2\u0102\u015e583."},{"volume-title":"Proceedings of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann Publishers Inc.","author":"Thierens Dirk","key":"e_1_3_2_1_22_1","unstructured":"Dirk Thierens and David E. Goldberg . 1993. Mixing in Genetic Algorithms . In Proceedings of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann Publishers Inc. , San Francisco, CA, USA, 38\u00e2\u0102\u015e47. Dirk Thierens and David E. Goldberg. 1993. Mixing in Genetic Algorithms. In Proceedings of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 38\u00e2\u0102\u015e47."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"D. Thiruvady C. Blum and A. T. Ernst. 2019. Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO. In Hybrid Metaheuristics M. J. B. Aguilera C. Blum H. Gambini Santos P. Pinacho-Davidson and J. Godoy del Campo (Eds.). Springer International Publishing Cham 16--30.  D. Thiruvady C. Blum and A. T. Ernst. 2019. Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO. In Hybrid Metaheuristics M. J. B. Aguilera C. Blum H. Gambini Santos P. Pinacho-Davidson and J. Godoy del Campo (Eds.). Springer International Publishing Cham 16--30.","DOI":"10.1007\/978-3-030-05983-5_2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.09.007"}],"event":{"name":"GECCO '20: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Canc\u00fan Mexico","acronym":"GECCO '20"},"container-title":["Proceedings of the 2020 Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390207","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377930.3390207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:40:59Z","timestamp":1750200059000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,25]]},"references-count":24,"alternative-id":["10.1145\/3377930.3390207","10.1145\/3377930"],"URL":"https:\/\/doi.org\/10.1145\/3377930.3390207","relation":{},"subject":[],"published":{"date-parts":[[2020,6,25]]},"assertion":[{"value":"2020-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}