{"id":"https://openalex.org/W1998571119","doi":"https://doi.org/10.1007/s10288-006-0017-1","title":"Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem","display_name":"Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem","publication_year":2006,"publication_date":"2006-07-24","ids":{"openalex":"https://openalex.org/W1998571119","doi":"https://doi.org/10.1007/s10288-006-0017-1","mag":"1998571119"},"language":"en","primary_location":{"id":"doi:10.1007/s10288-006-0017-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10288-006-0017-1","pdf_url":null,"source":{"id":"https://openalex.org/S4210191715","display_name":"4OR","issn_l":"1614-2411","issn":["1614-2411","1619-4500"],"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":"4OR","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/A5089867399","display_name":"Fabrice Tercinet","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fabrice Tercinet","raw_affiliation_strings":["Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 Fran\u00e7ois Rabelais de Tours, EA2101, Tours, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 Fran\u00e7ois Rabelais de Tours, EA2101, Tours, France","institution_ids":["https://openalex.org/I110017253"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Emmanuel N\u00e9ron","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]},{"id":"https://openalex.org/I4210095477","display_name":"Centre Hospitalier Universitaire de Tours","ror":"https://ror.org/00jpq0w62","country_code":"FR","type":"healthcare","lineage":["https://openalex.org/I4210095477"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Emmanuel N\u00e9ron","raw_affiliation_strings":["Department of Computer Sciences, Polytech\u2019Tours, 64 av. Jean Portalis, 37200, Tours, France","Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 Fran\u00e7ois Rabelais de Tours, EA2101, Tours, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Polytech\u2019Tours, 64 av. Jean Portalis, 37200, Tours, France","institution_ids":["https://openalex.org/I4210095477"]},{"raw_affiliation_string":"Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 Fran\u00e7ois Rabelais de Tours, EA2101, Tours, France","institution_ids":["https://openalex.org/I110017253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110180498","display_name":"Christophe Lent\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christophe Lent\u00e9","raw_affiliation_strings":["Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 Fran\u00e7ois Rabelais de Tours, EA2101, Tours, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 Fran\u00e7ois Rabelais de Tours, EA2101, Tours, France","institution_ids":["https://openalex.org/I110017253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I110017253","https://openalex.org/I4210095477"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.4607,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88309372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"4","issue":"4","first_page":"297","last_page":"317"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9994999766349792,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9965000152587891,"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/bin-packing-problem","display_name":"Bin packing problem","score":0.9656941890716553},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.763565719127655},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.7312906384468079},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6336243748664856},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.6020074486732483},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5694096088409424},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.509992241859436},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5095041394233704},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4624163806438446},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44569894671440125},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4363565146923065},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.42366084456443787},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.41980984807014465},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4156757891178131},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3096628785133362},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1111828088760376},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09345945715904236}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9656941890716553},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.763565719127655},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.7312906384468079},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6336243748664856},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.6020074486732483},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5694096088409424},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.509992241859436},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5095041394233704},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4624163806438446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44569894671440125},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4363565146923065},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.42366084456443787},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.41980984807014465},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4156757891178131},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3096628785133362},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1111828088760376},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09345945715904236},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10288-006-0017-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10288-006-0017-1","pdf_url":null,"source":{"id":"https://openalex.org/S4210191715","display_name":"4OR","issn_l":"1614-2411","issn":["1614-2411","1619-4500"],"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":"4OR","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W62761189","https://openalex.org/W579208063","https://openalex.org/W964861289","https://openalex.org/W1515176649","https://openalex.org/W1980289219","https://openalex.org/W2009217405","https://openalex.org/W2022759528","https://openalex.org/W2027726568","https://openalex.org/W2043862089","https://openalex.org/W2049403394","https://openalex.org/W2051385001","https://openalex.org/W2065427999","https://openalex.org/W2076677764","https://openalex.org/W2087245794","https://openalex.org/W2093188170","https://openalex.org/W2142050419","https://openalex.org/W2168941994","https://openalex.org/W2224313841","https://openalex.org/W2337842618","https://openalex.org/W2341350247","https://openalex.org/W2399594521","https://openalex.org/W2576116471","https://openalex.org/W2808376720","https://openalex.org/W3044911583","https://openalex.org/W4240119221","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W173368591","https://openalex.org/W2034272113","https://openalex.org/W2138242427","https://openalex.org/W4288260564","https://openalex.org/W4255148175","https://openalex.org/W2104955674","https://openalex.org/W2068892231","https://openalex.org/W2096053066"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}