{"id":"https://openalex.org/W2011637884","doi":"https://doi.org/10.1016/s0166-218x(97)00092-9","title":"Batch scheduling and common due date assignment problem: An NP-hard case","display_name":"Batch scheduling and common due date assignment problem: An NP-hard case","publication_year":1997,"publication_date":"1997-12-01","ids":{"openalex":"https://openalex.org/W2011637884","doi":"https://doi.org/10.1016/s0166-218x(97)00092-9","mag":"2011637884"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(97)00092-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(97)00092-9","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/A5049674028","display_name":"Mikhail Y. Kovalyov","orcid":"https://orcid.org/0000-0003-0832-0829"},"institutions":[{"id":"https://openalex.org/I4210105192","display_name":"United Institute of Informatics Problems","ror":"https://ror.org/01ccbsb07","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210105192","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":true,"raw_author_name":"Mikhail Y. Kovalyov","raw_affiliation_strings":["Institute of Engineering Cybernetics, Belarus Academy of Sciences, Surganova 6, 220012 Minsk, Belarus","Institute of Engineering Cybernetics, Belarus Academy of Sciences, Surganova 6, 220012 Minsk, Belarus#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Engineering Cybernetics, Belarus Academy of Sciences, Surganova 6, 220012 Minsk, Belarus","institution_ids":["https://openalex.org/I4210105192"]},{"raw_affiliation_string":"Institute of Engineering Cybernetics, Belarus Academy of Sciences, Surganova 6, 220012 Minsk, Belarus#TAB#","institution_ids":["https://openalex.org/I4210105192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049674028"],"corresponding_institution_ids":["https://openalex.org/I4210105192"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":1.1765,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78056052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"80","issue":"2-3","first_page":"251","last_page":"254"},"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.9951000213623047,"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.9951000213623047,"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.699231743812561},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5821890234947205},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.5248582363128662},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5175706744194031},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5145561099052429},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4213102459907532},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4118083417415619},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38779380917549133},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.29804307222366333},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2712358832359314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25161969661712646},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09142273664474487},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08171194791793823}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.699231743812561},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5821890234947205},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.5248582363128662},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5175706744194031},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5145561099052429},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4213102459907532},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4118083417415619},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38779380917549133},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29804307222366333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2712358832359314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25161969661712646},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09142273664474487},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08171194791793823},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0166-218x(97)00092-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(97)00092-9","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.7200000286102295,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2011039300","https://openalex.org/W2095954785"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W2998357381","https://openalex.org/W2101020326","https://openalex.org/W3204654320","https://openalex.org/W2810583502"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-20T08:49:12.498775","created_date":"2025-10-10T00:00:00"}