{"id":"https://openalex.org/W2079870327","doi":"https://doi.org/10.1016/j.dam.2011.07.005","title":"Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times","display_name":"Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times","publication_year":2011,"publication_date":"2011-08-06","ids":{"openalex":"https://openalex.org/W2079870327","doi":"https://doi.org/10.1016/j.dam.2011.07.005","mag":"2079870327"},"language":"en","primary_location":{"id":"doi:10.1016/j.dam.2011.07.005","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2011.07.005","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X11002435/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/S0166218X11002435/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075247612","display_name":"Imed Kacem","orcid":"https://orcid.org/0000-0001-6649-7257"},"institutions":[{"id":"https://openalex.org/I4210115482","display_name":"Laboratoire d'\u00c9tude des Microstructures et de M\u00e9canique des Mat\u00e9riaux","ror":"https://ror.org/01nyrrx14","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I190752583","https://openalex.org/I190861549","https://openalex.org/I4210095849","https://openalex.org/I4210115482","https://openalex.org/I4210134562","https://openalex.org/I4210150706","https://openalex.org/I90183372","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Imed Kacem","raw_affiliation_strings":["LITA, University of Metz, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LITA, University of Metz, France","institution_ids":["https://openalex.org/I4210115482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079478965","display_name":"Hans Kellerer","orcid":"https://orcid.org/0000-0001-7618-3956"},"institutions":[{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Hans Kellerer","raw_affiliation_strings":["ISOR, University of Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISOR, University of Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075247612"],"corresponding_institution_ids":["https://openalex.org/I4210115482"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":null,"fwci":3.5959,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.92446587,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":"164","issue":null,"first_page":"154","last_page":"160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.994700014591217,"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/idle","display_name":"Idle","score":0.8175941109657288},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.697803795337677},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5961964726448059},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5900469422340393},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.572774350643158},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5479838252067566},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5468510985374451},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5463982820510864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5432726740837097},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5175113677978516},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.467398464679718},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.42072415351867676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3383375406265259}],"concepts":[{"id":"https://openalex.org/C16320812","wikidata":"https://www.wikidata.org/wiki/Q1812200","display_name":"Idle","level":2,"score":0.8175941109657288},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.697803795337677},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5961964726448059},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5900469422340393},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.572774350643158},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5479838252067566},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5468510985374451},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5463982820510864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5432726740837097},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5175113677978516},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.467398464679718},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.42072415351867676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3383375406265259},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.dam.2011.07.005","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2011.07.005","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X11002435/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01783535v1","is_oa":false,"landing_page_url":"https://hal.univ-lorraine.fr/hal-01783535","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Applied Mathematics, 2014, 164, pp.154 - 160. ⟨10.1016/j.dam.2011.07.005⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/j.dam.2011.07.005","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2011.07.005","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X11002435/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321103","display_name":"Conseil R\u00e9gional Champagne Ardenne","ror":"https://ror.org/018vkvj59"},{"id":"https://openalex.org/F4320330551","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2079870327.pdf","grobid_xml":"https://content.openalex.org/works/W2079870327.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1484610295","https://openalex.org/W1501066815","https://openalex.org/W1537316992","https://openalex.org/W1974776021","https://openalex.org/W1976720470","https://openalex.org/W1990313671","https://openalex.org/W2005012890","https://openalex.org/W2011999391","https://openalex.org/W2036317481","https://openalex.org/W2058004157","https://openalex.org/W2082338286","https://openalex.org/W2086012697","https://openalex.org/W2163085705","https://openalex.org/W2171210634","https://openalex.org/W2186333639","https://openalex.org/W2328602514","https://openalex.org/W2395163714","https://openalex.org/W2743045177","https://openalex.org/W6632111734","https://openalex.org/W6742705900"],"related_works":["https://openalex.org/W2522192761","https://openalex.org/W2042776370","https://openalex.org/W2364465556","https://openalex.org/W2153799489","https://openalex.org/W2060337406","https://openalex.org/W2774328138","https://openalex.org/W1995112769","https://openalex.org/W2962917430","https://openalex.org/W2060500675","https://openalex.org/W2028468530"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}