{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T19:51:33Z","timestamp":1780602693702,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:00:00Z","timestamp":1714089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:00:00Z","timestamp":1714089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["406245\/2021-5"],"award-info":[{"award-number":["406245\/2021-5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["309580\/2021-8"],"award-info":[{"award-number":["309580\/2021-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018802","name":"Universidade Federal da Para\u00edba","doi-asserted-by":"publisher","award":["PVL13400-2020"],"award-info":[{"award-number":["PVL13400-2020"]}],"id":[{"id":"10.13039\/501100018802","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005669","name":"Funda\u00e7\u00e3o de Apoio \u00e1 Pesquisa do Estado da Para\u00edba","doi-asserted-by":"publisher","award":["2390\/2023"],"award-info":[{"award-number":["2390\/2023"]}],"id":[{"id":"10.13039\/501100005669","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00edgico","doi-asserted-by":"publisher","award":["150881\/2023-1"],"award-info":[{"award-number":["150881\/2023-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11590-024-02116-x","type":"journal-article","created":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T19:02:09Z","timestamp":1714158129000},"page":"193-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Population-based iterated local search for batch scheduling on parallel machines with incompatible job families, release dates, and tardiness penalties"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8895-1888","authenticated-orcid":false,"given":"Jos\u00e9 Maur\u00edcio Fernandes","family":"Medeiros","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eduardo","family":"Queiroga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,26]]},"reference":[{"key":"2116_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979). https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X","journal-title":"Ann. Discrete Math."},{"key":"2116_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"EL Lawler","year":"1977","unstructured":"Lawler, E.L.: A \u201cpseudopolynomial\u2019\u2019 algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1, 331\u2013342 (1977). https:\/\/doi.org\/10.1016\/S0167-5060(08)70742-8","journal-title":"Ann. Discrete Math."},{"key":"2116_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99849-7","volume-title":"Handbook on Scheduling: From Theory to Practice","author":"J Blazewicz","year":"2019","unstructured":"Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Sterna, M., Weglarz, J.: Handbook on Scheduling: From Theory to Practice. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-99849-7"},{"key":"2116_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","volume":"298","author":"JW Fowler","year":"2022","unstructured":"Fowler, J.W., M\u00f6h, L.: A survey of scheduling with parallel batch (p-batch) processing. Eur. J. Oper. Res. 298, 1\u201324 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.06.012","journal-title":"Eur. J. Oper. Res."},{"issue":"16","key":"2116_CR5","doi-asserted-by":"publisher","first-page":"5744","DOI":"10.1080\/00207543.2022.2102449","volume":"61","author":"M Vimala Rani","year":"2022","unstructured":"Vimala Rani, M., Mathirajan, M.: A state-of-art review and a simple meta-analysis on deterministic scheduling of diffusion furnaces in semiconductor manufactoring. Int. J. Prod. Res. 61(16), 5744\u20135771 (2022). https:\/\/doi.org\/10.1080\/00207543.2022.2102449","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"2116_CR6","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C-Y Lee","year":"1992","unstructured":"Lee, C.-Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40(4), 764\u2013775 (1992). https:\/\/doi.org\/10.1287\/opre.40.4.764","journal-title":"Oper. Res."},{"issue":"11","key":"2116_CR7","doi-asserted-by":"publisher","first-page":"2731","DOI":"10.1016\/j.cor.2004.04.001","volume":"32","author":"L M\u00f6nch","year":"2005","unstructured":"M\u00f6nch, L., Balasubramanian, H., Fowler, J.W., Pfund, M.E.: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Comput. Oper. Res. 32(11), 2731\u20132750 (2005). https:\/\/doi.org\/10.1016\/j.cor.2004.04.001","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"2116_CR8","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1016\/j.cor.2010.03.017","volume":"37","author":"T-C Chiang","year":"2010","unstructured":"Chiang, T.-C., Cheng, H.-C., Fu, L.-C.: A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival. Comput. Oper. Res. 37(12), 2257\u20132269 (2010). https:\/\/doi.org\/10.1016\/j.cor.2010.03.017","journal-title":"Comput. Oper. Res."},{"key":"2116_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.cie.2014.10.008","volume":"78","author":"A Bilyk","year":"2014","unstructured":"Bilyk, A., M\u00f6nch, L., Almeder, C.: Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics. Comput. Ind. Eng. 78, 175\u2013185 (2014). https:\/\/doi.org\/10.1016\/j.cie.2014.10.008","journal-title":"Comput. Ind. Eng."},{"key":"2116_CR10","doi-asserted-by":"publisher","unstructured":"Fidelis, M.B., Arroyo, J.E.C.: Meta-heuristic algorithms for scheduling on parallel batch machines with unequal job ready times. In: 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 542\u2013547. IEEE, Banff (2017). https:\/\/doi.org\/10.1109\/SMC.2017.8122662","DOI":"10.1109\/SMC.2017.8122662"},{"key":"2116_CR11","doi-asserted-by":"crossref","unstructured":"Klemmt, A., Weigert, G., Almeder, C., Monch, L.: A comparison of MIP-based decomposition techniques and VNS approaches for batch scheduling problems. In: Proceedings of the 2009 Winter Simulation Conference (WSC), pp. 1686\u20131694. IEEE (2009)","DOI":"10.1109\/WSC.2009.5429173"},{"issue":"8","key":"2116_CR12","doi-asserted-by":"publisher","first-page":"2462","DOI":"10.1080\/00207543.2012.748227","volume":"51","author":"JWF Eray Cakici","year":"2013","unstructured":"Eray Cakici, J.W.F., Mason, Scott J., Geismar, H.N.: Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families. Int. J. Prod. Res. 51(8), 2462\u20132477 (2013). https:\/\/doi.org\/10.1080\/00207543.2012.748227","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"2116_CR13","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1109\/TSM.2017.2740340","volume":"30","author":"A Ham","year":"2017","unstructured":"Ham, A., Fowler, J.W., Cakici, E.: Constraint programming approach for scheduling jobs with release times, non-identical sizes, and incompatible families on parallel batching machines. IEEE Trans. Semicond. Manuf. 30(4), 500\u2013507 (2017). https:\/\/doi.org\/10.1109\/TSM.2017.2740340","journal-title":"IEEE Trans. Semicond. Manuf."},{"issue":"2","key":"2116_CR14","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/s10601-023-09347-2","volume":"28","author":"M-L Lackner","year":"2023","unstructured":"Lackner, M.-L., Mrkvicka, C., Musliu, N., Walkiewicz, D., Winter, F.: Exact methods for the oven scheduling problem. Constraints 28(2), 320\u2013361 (2023). https:\/\/doi.org\/10.1007\/s10601-023-09347-2","journal-title":"Constraints"},{"issue":"8","key":"2116_CR15","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"APJ Vepsalainen","year":"1987","unstructured":"Vepsalainen, A.P.J., Morton, T.E.: Priority rules for job shops with weighted tardiness costs. Manag. Sci. 33(8), 1035\u20131047 (1987). https:\/\/doi.org\/10.1287\/mnsc.33.8.1035","journal-title":"Manag. Sci."},{"issue":"11","key":"2116_CR16","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, LMd.A., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899\u20131911 (2010). https:\/\/doi.org\/10.1016\/j.cor.2009.10.011","journal-title":"Comput. Oper. Res."},{"key":"2116_CR17","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10732-020-09461-x","volume":"27","author":"E Queiroga","year":"2021","unstructured":"Queiroga, E., Pinheiro, R.G.S., Christ, Q., Subramanian, A., Pessoa, A.A.: Iterated local search for single machine total weighted tardiness batch scheduling. J. Heuristics 27, 353\u2013438 (2021). https:\/\/doi.org\/10.1007\/s10732-020-09461-x","journal-title":"J. Heuristics"},{"key":"2116_CR18","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60, 611\u2013624 (2012). https:\/\/doi.org\/10.1287\/opre.1120.1048","journal-title":"Oper. Res."},{"key":"2116_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-023-00239-3","author":"M Lubin","year":"2023","unstructured":"Lubin, M., Dowson, O., Dias Garcia, J., Huchette, J., Legat, B., Vielma, J.P.: JuMP 1.0: recent improvements to a modeling language for mathematical optimization. Math. Program. Comput. (2023). https:\/\/doi.org\/10.1007\/s12532-023-00239-3","journal-title":"Math. Program. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02116-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02116-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02116-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T10:01:43Z","timestamp":1736935303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02116-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,26]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2116"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02116-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,26]]},"assertion":[{"value":"21 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}