{"id":"https://openalex.org/W2017333027","doi":"https://doi.org/10.1016/s0166-218x(97)81448-5","title":"On complexity of minimizing weighted number of late jobs in unit time open shops","display_name":"On complexity of minimizing weighted number of late jobs in unit time open shops","publication_year":1997,"publication_date":"1997-04-01","ids":{"openalex":"https://openalex.org/W2017333027","doi":"https://doi.org/10.1016/s0166-218x(97)81448-5","mag":"2017333027"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(97)81448-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(97)81448-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X97814485/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/S0166218X97814485/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011573185","display_name":"A.A. Gladky","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A.A. Gladky","raw_affiliation_strings":["Institute of Engineering Cybernetics, Byelorussian Academy of Sciences, ul. Surganova 6, 220012 Minsk, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Engineering Cybernetics, Byelorussian Academy of Sciences, ul. Surganova 6, 220012 Minsk, Russia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5011573185"],"corresponding_institution_ids":[],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":1.0564,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77201375,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"74","issue":"2","first_page":"197","last_page":"201"},"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9976000189781189,"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.9957000017166138,"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/open-shop","display_name":"Open shop","score":0.80799400806427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6977579593658447},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.649587094783783},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4378354847431183},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4165031909942627},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37962228059768677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21228912472724915},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.20561957359313965},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.1656392216682434},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.07919922471046448}],"concepts":[{"id":"https://openalex.org/C2776484797","wikidata":"https://www.wikidata.org/wiki/Q7096412","display_name":"Open shop","level":5,"score":0.80799400806427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6977579593658447},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.649587094783783},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4378354847431183},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4165031909942627},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37962228059768677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21228912472724915},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.20561957359313965},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.1656392216682434},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.07919922471046448},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0166-218x(97)81448-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(97)81448-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X97814485/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"}],"best_oa_location":{"id":"doi:10.1016/s0166-218x(97)81448-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(97)81448-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X97814485/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":"Decent work and economic growth","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2017333027.pdf","grobid_xml":"https://content.openalex.org/works/W2017333027.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W95437694","https://openalex.org/W1488422606","https://openalex.org/W1978964060","https://openalex.org/W2073377450","https://openalex.org/W2078331920","https://openalex.org/W6603778142","https://openalex.org/W6668601232","https://openalex.org/W7051702471"],"related_works":["https://openalex.org/W4205129545","https://openalex.org/W611386996","https://openalex.org/W3094194260","https://openalex.org/W2980963558","https://openalex.org/W2371343292","https://openalex.org/W2804958010","https://openalex.org/W2040889502","https://openalex.org/W2076906849","https://openalex.org/W2059428776","https://openalex.org/W2109073642"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}