{"id":"https://openalex.org/W2065104488","doi":"https://doi.org/10.1016/0166-218x(81)90008-1","title":"Fast approximation algorithm for job sequencing with deadlines","display_name":"Fast approximation algorithm for job sequencing with deadlines","publication_year":1981,"publication_date":"1981-11-01","ids":{"openalex":"https://openalex.org/W2065104488","doi":"https://doi.org/10.1016/0166-218x(81)90008-1","mag":"2065104488"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(81)90008-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(81)90008-1","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108430472","display_name":"G. V. Gens","orcid":null},"institutions":[{"id":"https://openalex.org/I2802368776","display_name":"Central Economics and Mathematics Institute","ror":"https://ror.org/02n937p61","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2802368776","https://openalex.org/I4210120228"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"G.V. Gens","raw_affiliation_strings":["Central Economic and Mathematical Institute, Moscow, USSR"],"affiliations":[{"raw_affiliation_string":"Central Economic and Mathematical Institute, Moscow, USSR","institution_ids":["https://openalex.org/I2802368776"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108144978","display_name":"Eugene Levner","orcid":null},"institutions":[{"id":"https://openalex.org/I2802368776","display_name":"Central Economics and Mathematics Institute","ror":"https://ror.org/02n937p61","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2802368776","https://openalex.org/I4210120228"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"E.V. Levner","raw_affiliation_strings":["Central Economic and Mathematical Institute, Moscow, USSR"],"affiliations":[{"raw_affiliation_string":"Central Economic and Mathematical Institute, Moscow, USSR","institution_ids":["https://openalex.org/I2802368776"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108430472"],"corresponding_institution_ids":["https://openalex.org/I2802368776"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":99,"citation_normalized_percentile":{"value":0.29661017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"3","issue":"4","first_page":"313","last_page":"318"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9984999895095825,"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/T12288","display_name":"Optimization and Search Problems","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6157054305076599},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5584436058998108},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5574086904525757},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5155410766601562},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5024142265319824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.489674836397171},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4854057729244232},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4725838899612427},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46596577763557434},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.4586889445781708},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.45034828782081604},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44345471262931824},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34998607635498047},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2980107367038727}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6157054305076599},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5584436058998108},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5574086904525757},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5155410766601562},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5024142265319824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.489674836397171},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4854057729244232},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4725838899612427},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46596577763557434},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.4586889445781708},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.45034828782081604},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44345471262931824},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34998607635498047},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2980107367038727},{"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0166-218x(81)90008-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(81)90008-1","pdf_url":null,"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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W78507853","https://openalex.org/W129922982","https://openalex.org/W2026891055","https://openalex.org/W2066356146","https://openalex.org/W2067297441","https://openalex.org/W2107216979","https://openalex.org/W2401610261","https://openalex.org/W6605263871","https://openalex.org/W6644040475"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2142195909","https://openalex.org/W1966261337","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":5}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}
