{"id":"https://openalex.org/W2135511120","doi":"https://doi.org/10.1142/s179383090900018x","title":"BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS","display_name":"BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2135511120","doi":"https://doi.org/10.1142/s179383090900018x","mag":"2135511120"},"language":"en","primary_location":{"id":"doi:10.1142/s179383090900018x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383090900018x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","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/A5015140021","display_name":"Baoqiang Fan","orcid":"https://orcid.org/0000-0002-1557-4045"},"institutions":[{"id":"https://openalex.org/I182707071","display_name":"Ludong University","ror":"https://ror.org/028h95t32","country_code":"CN","type":"education","lineage":["https://openalex.org/I182707071"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"BAOQIANG FAN","raw_affiliation_strings":["Department of Mathematics and Information, Ludong University, Yantai, 264025, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Information, Ludong University, Yantai, 264025, P. R. China","institution_ids":["https://openalex.org/I182707071"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035131824","display_name":"Rongjun Chen","orcid":"https://orcid.org/0000-0002-3075-460X"},"institutions":[{"id":"https://openalex.org/I4210108723","display_name":"Changzhou Institute of Technology","ror":"https://ror.org/020mrfq61","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210108723"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"RONGJUN CHEN","raw_affiliation_strings":["Department of Mathematics, Changzhou Institute of Technology, Changzhou 213002, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Changzhou Institute of Technology, Changzhou 213002, P. R. China","institution_ids":["https://openalex.org/I4210108723"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110247440","display_name":"Guochun Tang","orcid":null},"institutions":[{"id":"https://openalex.org/I135905480","display_name":"Shanghai Polytechnic University","ror":"https://ror.org/02as5yg64","country_code":"CN","type":"education","lineage":["https://openalex.org/I135905480"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"GUOCHUN TANG","raw_affiliation_strings":["Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai 201209, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai 201209, P. R. China","institution_ids":["https://openalex.org/I135905480"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20844656,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"01","issue":"02","first_page":"227","last_page":"234"},"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.9966999888420105,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9962999820709229,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8150127530097961},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6550849676132202},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.6425514221191406},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6412110924720764},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6087546348571777},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5528615117073059},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.5293957591056824},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4881320893764496},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41524964570999146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3415243923664093},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07463622093200684}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8150127530097961},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6550849676132202},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.6425514221191406},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6412110924720764},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6087546348571777},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5528615117073059},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.5293957591056824},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4881320893764496},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41524964570999146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3415243923664093},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07463622093200684},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s179383090900018x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383090900018x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320325006","display_name":"Ludong University","ror":"https://ror.org/028h95t32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1983925783","https://openalex.org/W1988328380","https://openalex.org/W1990848197","https://openalex.org/W2005694644","https://openalex.org/W2006188511","https://openalex.org/W2010484711","https://openalex.org/W2028376777","https://openalex.org/W2030722133","https://openalex.org/W2033326904","https://openalex.org/W2042916753","https://openalex.org/W2055618925","https://openalex.org/W2067436380","https://openalex.org/W2093563804","https://openalex.org/W2107205433","https://openalex.org/W2167746336","https://openalex.org/W4211017838","https://openalex.org/W4236435395"],"related_works":["https://openalex.org/W2368250618","https://openalex.org/W2810352541","https://openalex.org/W2970302286","https://openalex.org/W2142195909","https://openalex.org/W1815446007","https://openalex.org/W2522192761","https://openalex.org/W2783992526","https://openalex.org/W2898780166","https://openalex.org/W2399328427","https://openalex.org/W2898646174"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"consider":[4],"the":[5,21,24,34,46,55,65,69,80],"single":[6],"machine":[7],"scheduling":[8],"problem":[9,35,47],"with":[10],"inventory":[11],"operations.":[12],"The":[13],"objective":[14],"is":[15,30,36,48,52,86],"to":[16,20],"minimize":[17],"makespan":[18],"subject":[19],"constraint":[22],"that":[23],"total":[25,56],"number":[26],"of":[27,68,79],"tardy":[28],"jobs":[29],"minimum.":[31],"We":[32],"show":[33],"strongly":[37],"NP-hard.":[38],"A":[39],"polynomial":[40],"[Formula:":[41],"see":[42],"text]-approximation":[43],"scheme":[44],"for":[45,75],"presented,":[49],"where":[50],"m":[51],"defined":[53],"as":[54],"job's":[57],"processing":[58],"times":[59],"\u2211":[60],"p":[61],"j":[62],"divided":[63],"by":[64],"capacity":[66],"c":[67],"storage,":[70],"and":[71],"an":[72],"optimal":[73],"algorithm":[74],"a":[76],"special":[77],"case":[78],"problem,":[81],"in":[82,89],"which":[83],"each":[84],"job":[85],"one":[87],"unit":[88],"size.":[90]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}