{"id":"https://openalex.org/W3204611586","doi":"https://doi.org/10.1007/s11590-021-01805-1","title":"Single machine batch scheduling with non-increasing time slot costs","display_name":"Single machine batch scheduling with non-increasing time slot costs","publication_year":2021,"publication_date":"2021-09-27","ids":{"openalex":"https://openalex.org/W3204611586","doi":"https://doi.org/10.1007/s11590-021-01805-1","mag":"3204611586"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-021-01805-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-021-01805-1","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","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/A5023752272","display_name":"Junfeng Ren","orcid":null},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]},{"id":"https://openalex.org/I4210166499","display_name":"Henan Polytechnic University","ror":"https://ror.org/05vr1c885","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210166499"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Junfeng Ren","raw_affiliation_strings":["Key Laboratory of Data Analytics and Optimization for Smart Industry (Northeastern University), Ministry of Education, Shenyang, 110819, China","School of Mathematics and Information Science, Henan Polytechnic University, Jiaozuo, 454000, China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Data Analytics and Optimization for Smart Industry (Northeastern University), Ministry of Education, Shenyang, 110819, China","institution_ids":["https://openalex.org/I9224756"]},{"raw_affiliation_string":"School of Mathematics and Information Science, Henan Polytechnic University, Jiaozuo, 454000, China","institution_ids":["https://openalex.org/I4210166499"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023752272"],"corresponding_institution_ids":["https://openalex.org/I4210166499","https://openalex.org/I9224756"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.1504,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56763029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":"6","first_page":"1817","last_page":"1833"},"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.9987000226974487,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9908000230789185,"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.9227111339569092},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6899555325508118},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6209897994995117},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5507956743240356},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5419337153434753},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5117347240447998},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.5036386847496033},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.48700910806655884},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.47629061341285706},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4344741702079773},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4281173646450043},{"id":"https://openalex.org/keywords/holding-cost","display_name":"Holding cost","score":0.4143928587436676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29319655895233154},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2461148202419281}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9227111339569092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6899555325508118},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6209897994995117},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5507956743240356},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5419337153434753},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5117347240447998},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.5036386847496033},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.48700910806655884},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.47629061341285706},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4344741702079773},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4281173646450043},{"id":"https://openalex.org/C192365026","wikidata":"https://www.wikidata.org/wiki/Q5046829","display_name":"Holding cost","level":2,"score":0.4143928587436676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29319655895233154},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2461148202419281},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11590-021-01805-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-021-01805-1","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1963935330","https://openalex.org/W1966523365","https://openalex.org/W1971129425","https://openalex.org/W1996431910","https://openalex.org/W2003813161","https://openalex.org/W2014889423","https://openalex.org/W2028893748","https://openalex.org/W2050859599","https://openalex.org/W2059961192","https://openalex.org/W2063792072","https://openalex.org/W2141097584","https://openalex.org/W2157793635","https://openalex.org/W2204019368","https://openalex.org/W2276780023","https://openalex.org/W2798842672","https://openalex.org/W2890539752","https://openalex.org/W2971555915","https://openalex.org/W3014711981","https://openalex.org/W3086457643"],"related_works":["https://openalex.org/W2162966494","https://openalex.org/W2051062041","https://openalex.org/W2017557756","https://openalex.org/W2153799489","https://openalex.org/W1593271705","https://openalex.org/W1973745066","https://openalex.org/W2951717752","https://openalex.org/W4251798786","https://openalex.org/W2057653555","https://openalex.org/W2381796141"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}