{"id":"https://openalex.org/W4416819935","doi":"https://doi.org/10.1007/s10878-025-01367-3","title":"A comparative computational study for parallel-machine problems with sustainable manufacturing constraints","display_name":"A comparative computational study for parallel-machine problems with sustainable manufacturing constraints","publication_year":2025,"publication_date":"2025-11-29","ids":{"openalex":"https://openalex.org/W4416819935","doi":"https://doi.org/10.1007/s10878-025-01367-3"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-025-01367-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-025-01367-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021741236","display_name":"Levi R. Abreu","orcid":"https://orcid.org/0000-0002-3773-9787"},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Levi R. Abreu","raw_affiliation_strings":["Department of Industrial Engineering, Federal University of Cear\u00e1, Campus do Pici, Fortaleza, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-3773-9787","affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Federal University of Cear\u00e1, Campus do Pici, Fortaleza, Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077602520","display_name":"Bruno de Athayde Prata","orcid":"https://orcid.org/0000-0002-3920-089X"},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Bruno A. Prata","raw_affiliation_strings":["Department of Industrial Engineering, Federal University of Cear\u00e1, Campus do Pici, Fortaleza, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-3920-089X","affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Federal University of Cear\u00e1, Campus do Pici, Fortaleza, Brazil","institution_ids":["https://openalex.org/I243754102"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021741236"],"corresponding_institution_ids":["https://openalex.org/I243754102"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43962703,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"50","issue":"5","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.7544000148773193,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.7544000148773193,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.03999999910593033,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","score":0.03350000083446503,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.8676999807357788},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7416999936103821},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5788999795913696},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5315999984741211},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5281000137329102},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4952999949455261},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.39579999446868896},{"id":"https://openalex.org/keywords/resource-consumption","display_name":"Resource consumption","score":0.37139999866485596}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8676999807357788},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7416999936103821},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6399000287055969},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6022999882698059},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5788999795913696},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5315999984741211},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5281000137329102},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4952999949455261},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.39579999446868896},{"id":"https://openalex.org/C2777480716","wikidata":"https://www.wikidata.org/wiki/Q23582796","display_name":"Resource consumption","level":2,"score":0.37139999866485596},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.336899995803833},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C61157135","wikidata":"https://www.wikidata.org/wiki/Q1345279","display_name":"Goal programming","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C128942645","wikidata":"https://www.wikidata.org/wiki/Q1568346","display_name":"Test case","level":3,"score":0.2515000104904175},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10878-025-01367-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-025-01367-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G168644185","display_name":null,"funder_award_id":"404264/2023-9","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G5862259007","display_name":null,"funder_award_id":"309755/2021-2","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G6021648879","display_name":null,"funder_award_id":"407151/2021-4","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1689539538","https://openalex.org/W1975784696","https://openalex.org/W1986806847","https://openalex.org/W1995660472","https://openalex.org/W2045408812","https://openalex.org/W2052693123","https://openalex.org/W2074541909","https://openalex.org/W2087245794","https://openalex.org/W2128130220","https://openalex.org/W2146696160","https://openalex.org/W2416420639","https://openalex.org/W2532427336","https://openalex.org/W2604573531","https://openalex.org/W2782628021","https://openalex.org/W2807159754","https://openalex.org/W2808566783","https://openalex.org/W2973381151","https://openalex.org/W2974201054","https://openalex.org/W2981862084","https://openalex.org/W2983535665","https://openalex.org/W2985033773","https://openalex.org/W2985052688","https://openalex.org/W2990572713","https://openalex.org/W2990729546","https://openalex.org/W3006629774","https://openalex.org/W3013966433","https://openalex.org/W3031562984","https://openalex.org/W3036265301","https://openalex.org/W3089462019","https://openalex.org/W3138844129","https://openalex.org/W3168227688","https://openalex.org/W3194627252","https://openalex.org/W4224053263","https://openalex.org/W4230161679","https://openalex.org/W4281390184","https://openalex.org/W4281864893","https://openalex.org/W4318016626","https://openalex.org/W4353070770","https://openalex.org/W4360978881","https://openalex.org/W4386331841","https://openalex.org/W4388948629","https://openalex.org/W4396237769","https://openalex.org/W4406549993"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-11-29T00:00:00"}