{"id":"https://openalex.org/W1968343827","doi":"https://doi.org/10.1137/s1052623494269540","title":"Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties","display_name":"Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties","publication_year":1997,"publication_date":"1997-05-01","ids":{"openalex":"https://openalex.org/W1968343827","doi":"https://doi.org/10.1137/s1052623494269540","mag":"1968343827"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623494269540","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494269540","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/6036/1/Cheng_Single_Machine_Batch.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032676950","display_name":"T.C.E. Cheng","orcid":"https://orcid.org/0000-0001-5127-6419"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"T. C. Edwin Cheng","raw_affiliation_strings":["Hong Kong Polytechnic University"],"affiliations":[{"raw_affiliation_string":"Hong Kong Polytechnic University","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049674028","display_name":"Mikhail Y. Kovalyov","orcid":"https://orcid.org/0000-0003-0832-0829"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mikhail Y. Kovalyov","raw_affiliation_strings":["Belarus Academy of Sciences,"],"affiliations":[{"raw_affiliation_string":"Belarus Academy of Sciences,","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053249974","display_name":"Bertrand M.T. Lin","orcid":"https://orcid.org/0000-0003-0456-296X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bertrand M. T. Lin","raw_affiliation_strings":["Department of Information Management and Finance"],"affiliations":[{"raw_affiliation_string":"Department of Information Management and Finance","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032676950"],"corresponding_institution_ids":["https://openalex.org/I14243506"],"apc_list":null,"apc_paid":null,"fwci":9.4027,"has_fulltext":true,"cited_by_count":36,"citation_normalized_percentile":{"value":0.97936792,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"7","issue":"2","first_page":"547","last_page":"559"},"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.9958999752998352,"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.9957000017166138,"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/heuristics","display_name":"Heuristics","score":0.6759189963340759},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.6436102390289307},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6252466440200806},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5793097615242004},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5784200429916382},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5507175326347351},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5404945015907288},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5392950773239136},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49758556485176086},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4597833752632141},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4489879608154297},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.43749701976776123},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4168005883693695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4068658947944641},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37152424454689026},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3533746004104614}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6759189963340759},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.6436102390289307},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6252466440200806},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5793097615242004},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5784200429916382},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5507175326347351},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5404945015907288},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5392950773239136},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49758556485176086},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4597833752632141},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4489879608154297},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.43749701976776123},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4168005883693695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4068658947944641},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37152424454689026},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3533746004104614},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623494269540","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494269540","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/6036","is_oa":true,"landing_page_url":"http://hdl.handle.net/10397/6036","pdf_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/6036/1/Cheng_Single_Machine_Batch.pdf","source":{"id":"https://openalex.org/S4306400205","display_name":"PolyU Institutional Research Archive (Hong Kong Polytechnic University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I14243506","host_organization_name":"Hong Kong Polytechnic University","host_organization_lineage":["https://openalex.org/I14243506"],"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":"Journal/Magazine Article"}],"best_oa_location":{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/6036","is_oa":true,"landing_page_url":"http://hdl.handle.net/10397/6036","pdf_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/6036/1/Cheng_Single_Machine_Batch.pdf","source":{"id":"https://openalex.org/S4306400205","display_name":"PolyU Institutional Research Archive (Hong Kong Polytechnic University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I14243506","host_organization_name":"Hong Kong Polytechnic University","host_organization_lineage":["https://openalex.org/I14243506"],"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":"Journal/Magazine Article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.699999988079071,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W1968343827.pdf"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1963935330","https://openalex.org/W1964122366","https://openalex.org/W1971346466","https://openalex.org/W1986345741","https://openalex.org/W1987131277","https://openalex.org/W2011039300","https://openalex.org/W2031298379","https://openalex.org/W2039769484","https://openalex.org/W2045429114","https://openalex.org/W2054029998","https://openalex.org/W2078144427","https://openalex.org/W2084814858","https://openalex.org/W2086474896","https://openalex.org/W2093252453","https://openalex.org/W2097984481","https://openalex.org/W2107216979","https://openalex.org/W2111001493","https://openalex.org/W2148393763"],"related_works":["https://openalex.org/W2165127677","https://openalex.org/W2140318223","https://openalex.org/W3143937874","https://openalex.org/W2774921197","https://openalex.org/W1969457277","https://openalex.org/W2031409011","https://openalex.org/W4200388139","https://openalex.org/W2105821629","https://openalex.org/W2886143600","https://openalex.org/W2368692400"],"abstract_inverted_index":{"We":[0],"study":[1],"a":[2,6,22,52,71,76,104,110,187,226],"problem":[3,130,165],"in":[4,70,249],"which":[5,91,193],"set":[7],"of":[8,36,46,54,66,75,87,107,118,228],"n":[9],"jobs":[10],"has":[11],"to":[12,90,102,114,133,168],"be":[13,134,169],"batched":[14],"as":[15,17,62,80,113],"well":[16],"scheduled":[18],"for":[19,150,159,196,208],"processing":[20,218],"on":[21,234],"single":[23],"machine.":[24],"A":[25,41],"constant":[26,161,198],"machine":[27],"set-up":[28,143,175],"time":[29,59,65,86,144,176],"is":[30,39,60,78,101,131,145,166,177,191,194,230],"required":[31],"before":[32],"the":[33,44,63,67,81,84,88,95,116,119,142,174,183,209,223,235,245],"first":[34],"job":[35,69,77,96,122],"each":[37,49],"batch":[38,50,57,89,126],"processed.":[40],"schedule":[42,111],"specifies":[43],"sequence":[45,53],"batches,":[47],"where":[48],"comprises":[51],"jobs.":[55],"The":[56,73,99,129,164,241],"delivery":[58,85,127],"defined":[61,79],"completion":[64,97],"last":[68],"batch.":[72],"earliness":[74,123],"difference":[82],"between":[83],"it":[92],"belongs":[93],"and":[94,109,124,147,179],"time.":[98,128],"objective":[100],"find":[103],"number":[105],"B":[106],"batches":[108],"so":[112],"minimize":[115],"sum":[117],"total":[120],"weighted":[121],"mean":[125],"shown":[132],"strongly":[135,139],"NP-hard.":[136],"It":[137],"remains":[138],"$NP$-hard":[140],"if":[141,156,173],"zero":[146,178],"$B\\le":[148,180,185],"U$":[149,158],"any":[151,160,197],"variable":[152],"$U\\ge":[153,162,199],"2$":[154],"or":[155,216],"$B\\ge":[157],"2$.":[163,181,200],"proved":[167],"ordinary":[170],"NP-hard":[171],"even":[172],"For":[182,222],"case":[184],"U$,":[186],"dynamic":[188],"programming":[189],"algorithm":[190,238],"presented,":[192],"pseudopolynomial":[195],"Algorithms":[201],"with":[202],"O(n\u00b9)":[203],"running":[204],"times":[205,219],"are":[206,214,220,239,247],"derived":[207],"cases":[210],"when":[211],"all":[212,217],"weights":[213],"equal":[215],"equal.":[221],"general":[224],"problem,":[225],"family":[227],"heuristics":[229,246],"suggested.":[231],"Computational":[232],"experiments":[233],"proposed":[236],"heuristic":[237],"conducted.":[240],"results":[242],"suggest":[243],"that":[244],"effective":[248],"generating":[250],"near-optimal":[251],"solutions":[252],"quickly.":[253]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}