{"id":"https://openalex.org/W2089787208","doi":"https://doi.org/10.1142/s0129054110007301","title":"MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK","display_name":"MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2089787208","doi":"https://doi.org/10.1142/s0129054110007301","mag":"2089787208"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054110007301","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054110007301","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/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":true,"raw_author_name":"HANS KELLERER","raw_affiliation_strings":["Institut f\u00fcr Statistik und Operations Research, Universit\u00e4t Graz, Universit\u00e4tstra\u00dfe 15, A-8010, Graz, Austria"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Statistik und Operations Research, Universit\u00e4t Graz, Universit\u00e4tstra\u00dfe 15, A-8010, Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049506022","display_name":"Vitaly A. Strusevich","orcid":"https://orcid.org/0000-0002-4602-8573"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"VITALY A. STRUSEVICH","raw_affiliation_strings":["School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, Greenwich, London SE10 9LS, U.K"],"affiliations":[{"raw_affiliation_string":"School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, Greenwich, London SE10 9LS, U.K","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079478965"],"corresponding_institution_ids":["https://openalex.org/I15766117"],"apc_list":null,"apc_paid":null,"fwci":4.8725,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.94533416,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"03","first_page":"357","last_page":"383"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.9452763795852661},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8896824717521667},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7725108861923218},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6588823199272156},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5450114011764526},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4951578676700592},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4687165319919586},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45154237747192383},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4294130206108093},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.41147756576538086},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.41034823656082153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34620317816734314},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3388853669166565},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2989041209220886}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9452763795852661},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8896824717521667},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7725108861923218},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6588823199272156},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5450114011764526},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4951578676700592},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4687165319919586},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45154237747192383},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4294130206108093},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.41147756576538086},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.41034823656082153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34620317816734314},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3388853669166565},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2989041209220886},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"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.1142/s0129054110007301","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054110007301","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:gala.gre.ac.uk:5654","is_oa":false,"landing_page_url":"http://gala.gre.ac.uk/id/eprint/5654/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401244","display_name":"Greenwich Academic Literature Archive (University of Greenwich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I55060895","host_organization_name":"University of Greenwich","host_organization_lineage":["https://openalex.org/I55060895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1988328380","https://openalex.org/W1993200481","https://openalex.org/W2041944550","https://openalex.org/W2056177557","https://openalex.org/W2069596575","https://openalex.org/W2082782506","https://openalex.org/W2083187712","https://openalex.org/W2091164478","https://openalex.org/W2093067798","https://openalex.org/W2093570686","https://openalex.org/W2102588682","https://openalex.org/W2107205433","https://openalex.org/W2168825111","https://openalex.org/W4236127247"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W3166857172","https://openalex.org/W3169691842","https://openalex.org/W1701984136","https://openalex.org/W2122137596","https://openalex.org/W2060645964","https://openalex.org/W1601835603","https://openalex.org/W1984121220","https://openalex.org/W1994753237"],"abstract_inverted_index":{"We":[0],"design":[1],"a":[2,9,25,53,62,73,81],"fully":[3],"polynomial-time":[4],"approximation":[5,37],"scheme":[6],"(FPTAS)":[7],"for":[8,32,52],"single":[10],"machine":[11],"scheduling":[12],"problem":[13,34,59,75],"to":[14,24,60],"minimize":[15,61],"the":[16,57,68,89],"total":[17],"weighted":[18],"earliness":[19],"and":[20],"tardiness":[21],"with":[22],"respect":[23],"common":[26],"restrictive":[27],"due":[28],"date.":[29],"Notice":[30],"that":[31],"this":[33],"no":[35],"constant-ratio":[36],"algorithm":[38,79],"has":[39],"been":[40],"known":[41],"so":[42],"far.":[43],"Our":[44],"approach":[45],"is":[46,92],"based":[47],"on":[48],"adopting":[49],"an":[50,78],"FPTAS":[51,91],"special":[54],"version":[55],"of":[56,71,80,88],"knapsack":[58,74],"convex":[63],"quadratic":[64,82],"non-separable":[65],"function.":[66],"For":[67],"continuous":[69],"relaxation":[70],"such":[72],"we":[76],"give":[77],"time":[83,87],"complexity.":[84],"The":[85],"running":[86],"resulting":[90],"strongly":[93],"polynomial.":[94]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}