{"id":"https://openalex.org/W2651978640","doi":"https://doi.org/10.1142/s0217595917400140","title":"Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs","display_name":"Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2651978640","doi":"https://doi.org/10.1142/s0217595917400140","mag":"2651978640"},"language":"en","primary_location":{"id":"doi:10.1142/s0217595917400140","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595917400140","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"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":"Asia-Pacific Journal of Operational Research","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/A5001636273","display_name":"Hua Gong","orcid":"https://orcid.org/0000-0003-2260-4617"},"institutions":[{"id":"https://openalex.org/I116036724","display_name":"Shenyang Ligong University","ror":"https://ror.org/03m20nr07","country_code":"CN","type":"education","lineage":["https://openalex.org/I116036724"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hua Gong","raw_affiliation_strings":["Liaoning Key Laboratory of Manufacturing Technology and Equipment, College of Science, Shenyang Ligong University, Shenyang, 110159, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Liaoning Key Laboratory of Manufacturing Technology and Equipment, College of Science, Shenyang Ligong University, Shenyang, 110159, P. R. China","institution_ids":["https://openalex.org/I116036724"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069904028","display_name":"Ermei Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I116036724","display_name":"Shenyang Ligong University","ror":"https://ror.org/03m20nr07","country_code":"CN","type":"education","lineage":["https://openalex.org/I116036724"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ermei Zhang","raw_affiliation_strings":["College of Science, Shenyang Ligong University, Shenyang, 110159, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Science, Shenyang Ligong University, Shenyang, 110159, P. R. China","institution_ids":["https://openalex.org/I116036724"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100453062","display_name":"Fang Liu","orcid":"https://orcid.org/0000-0002-4447-0157"},"institutions":[{"id":"https://openalex.org/I116036724","display_name":"Shenyang Ligong University","ror":"https://ror.org/03m20nr07","country_code":"CN","type":"education","lineage":["https://openalex.org/I116036724"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fang Liu","raw_affiliation_strings":["College of Science, Shenyang Ligong University, Shenyang, 110159, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Science, Shenyang Ligong University, Shenyang, 110159, P. R. China","institution_ids":["https://openalex.org/I116036724"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001636273"],"corresponding_institution_ids":["https://openalex.org/I116036724"],"apc_list":null,"apc_paid":null,"fwci":0.3075,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64374514,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"34","issue":"03","first_page":"1740014","last_page":"1740014"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9979000091552734,"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.9969000220298767,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7053858041763306},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6579583287239075},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.6552483439445496},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6082352995872498},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5320255160331726},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.526541531085968},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5172675251960754},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5149720311164856},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4933449327945709},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.473328173160553},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44790881872177124},{"id":"https://openalex.org/keywords/production","display_name":"Production (economics)","score":0.4322670102119446},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.43020814657211304},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3070182800292969},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.28852349519729614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23788508772850037},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.1095007061958313}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7053858041763306},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6579583287239075},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.6552483439445496},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6082352995872498},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5320255160331726},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.526541531085968},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5172675251960754},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5149720311164856},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4933449327945709},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.473328173160553},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44790881872177124},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.4322670102119446},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.43020814657211304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3070182800292969},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.28852349519729614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23788508772850037},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.1095007061958313},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0217595917400140","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595917400140","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"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":"Asia-Pacific Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:wsi:apjorx:v:34:y:2017:i:03:n:s0217595917400140","is_oa":false,"landing_page_url":"http://www.worldscientific.com/doi/abs/10.1142/S0217595917400140","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1505402242","https://openalex.org/W1978898155","https://openalex.org/W1991919166","https://openalex.org/W2001332839","https://openalex.org/W2001937628","https://openalex.org/W2011039300","https://openalex.org/W2018085196","https://openalex.org/W2020358647","https://openalex.org/W2036869053","https://openalex.org/W2043208840","https://openalex.org/W2050552184","https://openalex.org/W2057960110","https://openalex.org/W2085327584","https://openalex.org/W2086256122","https://openalex.org/W2108648237","https://openalex.org/W2161384986","https://openalex.org/W4211017838"],"related_works":["https://openalex.org/W2073298047","https://openalex.org/W1963790170","https://openalex.org/W2586328217","https://openalex.org/W2033790662","https://openalex.org/W2049264236","https://openalex.org/W1974309933","https://openalex.org/W317165722","https://openalex.org/W2092240563","https://openalex.org/W312725187","https://openalex.org/W2728870795"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,131],"consider":[4],"a":[5,10,23,37,40,117,133,137],"coordinated":[6],"scheduling":[7],"problem":[8,103,154],"on":[9,67,151],"single":[11,27],"batching":[12,28],"machine":[13,29],"with":[14,77,116],"transportation":[15,60],"and":[16,84,94,121,136,139,156,159],"deterioration.":[17],"The":[18,33,70],"jobs":[19],"are":[20],"transported":[21],"by":[22],"vehicle":[24],"to":[25,51,61,73,89],"the":[26,52,56,59,62,65,68,85,91,95,101,128,146,157,167],"for":[30,112,166],"further":[31,108],"processing.":[32],"processing":[34],"time":[35,47,53,83,124],"of":[36,44,58,64,87],"job":[38,66,119],"is":[39,49,72,104],"step":[41],"increasing":[42],"function":[43],"its":[45],"exposure":[46,123],"which":[48],"equivalent":[50],"interval":[54],"from":[55],"beginning":[57],"starting":[63],"machine.":[69],"objective":[71],"find":[74],"Pareto-optimal":[75,164],"schedules":[76],"two":[78,113],"performance":[79],"criteria":[80],"(total":[81],"completion":[82],"number":[86],"batches)":[88],"balance":[90],"inventory":[92],"level":[93],"production":[96],"costs.":[97],"We":[98,107],"prove":[99],"that":[100,145],"general":[102,129],"strongly":[105],"NP-hard.":[106],"develop":[109,132],"polynomial-time":[110],"algorithms":[111,148],"special":[114],"cases":[115],"fixed":[118],"sequence":[120],"without":[122],"limit,":[125],"respectively.":[126],"For":[127],"problem,":[130],"heuristic":[134,147],"algorithm":[135,161],"branch":[138,158],"bound":[140,160],"algorithm.":[141],"Computational":[142],"experiments":[143],"show":[144],"perform":[149],"well":[150],"randomly":[152],"generated":[153],"instances,":[155],"can":[162],"obtain":[163],"solutions":[165],"small-scaled":[168],"instances.":[169]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}