{"id":"https://openalex.org/W1969091796","doi":"https://doi.org/10.1142/s0129054104002637","title":"ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING","display_name":"ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING","publication_year":2004,"publication_date":"2004-08-01","ids":{"openalex":"https://openalex.org/W1969091796","doi":"https://doi.org/10.1142/s0129054104002637","mag":"1969091796"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054104002637","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054104002637","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","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/A5036513568","display_name":"Chung Keung Poon","orcid":"https://orcid.org/0000-0002-8508-5060"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"CHUNG KEUNG POON","raw_affiliation_strings":["Department of Computer Science,  City University of Hong Kong, 83 Tat Chee Avenue,  Koowloon Tong, Hong Kong, China","Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Koowloon Tong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  City University of Hong Kong, 83 Tat Chee Avenue,  Koowloon Tong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Koowloon Tong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100871630","display_name":"Yu Wenci","orcid":null},"institutions":[{"id":"https://openalex.org/I143593769","display_name":"East China University of Science and Technology","ror":"https://ror.org/01vyrm377","country_code":"CN","type":"education","lineage":["https://openalex.org/I143593769"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"WENCI YU","raw_affiliation_strings":["Institute of Applied Mathematics,  East China University of Science and Technology, 130, Meilong Road,  Shanghai 200237, China","Institute of Applied Mathematics, East China University of Science and Technology, 130, Meilong Road, Shanghai 200237, China"],"affiliations":[{"raw_affiliation_string":"Institute of Applied Mathematics,  East China University of Science and Technology, 130, Meilong Road,  Shanghai 200237, China","institution_ids":["https://openalex.org/I143593769"]},{"raw_affiliation_string":"Institute of Applied Mathematics, East China University of Science and Technology, 130, Meilong Road, Shanghai 200237, China","institution_ids":["https://openalex.org/I143593769"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036513568"],"corresponding_institution_ids":["https://openalex.org/I168719708"],"apc_list":null,"apc_paid":null,"fwci":2.5173,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88322981,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"15","issue":"04","first_page":"593","last_page":"607"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9965000152587891,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9904000163078308,"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/computer-science","display_name":"Computer science","score":0.6155591607093811},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.6069647073745728},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5808838605880737},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5244441628456116},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5044275522232056},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46459364891052246},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.4290936291217804},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4168608784675598},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3814162313938141},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34839916229248047},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10150963068008423},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09687250852584839}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6155591607093811},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.6069647073745728},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5808838605880737},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5244441628456116},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5044275522232056},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46459364891052246},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.4290936291217804},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4168608784675598},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3814162313938141},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34839916229248047},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10150963068008423},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09687250852584839},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054104002637","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054104002637","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2017896057","https://openalex.org/W2044439396","https://openalex.org/W2105821629","https://openalex.org/W2111001493","https://openalex.org/W2136186989"],"related_works":["https://openalex.org/W1956651153","https://openalex.org/W2347561926","https://openalex.org/W2088387432","https://openalex.org/W210339300","https://openalex.org/W2099326033","https://openalex.org/W1984267569","https://openalex.org/W1759995226","https://openalex.org/W3086456624","https://openalex.org/W2089134982","https://openalex.org/W2355603134"],"abstract_inverted_index":{"We":[0,64],"study":[1],"the":[2,34,49],"scheduling":[3],"problem":[4],"on":[5],"a":[6,14,19,22,67],"batch":[7,15,23],"machine":[8,24],"which":[9],"is":[10],"capable":[11],"of":[12,16,25,54],"processing":[13],"jobs":[17],"at":[18],"time.":[20],"For":[21],"capacity":[26],"c,":[27],"we":[28],"designed":[29,66],"an":[30],"algorithm":[31,69],"for":[32],"minimizing":[33],"total":[35],"completion":[36],"time":[37,42,52,72],"in":[38],"O(n":[39,55],"6c":[40],")":[41,57],"(for":[43],"sufficiently":[44],"large":[45],"c).":[46],"This":[47],"improves":[48],"best":[50],"previous":[51],"bound":[53],"c(c-1)":[56],"given":[58],"by":[59],"Brucker":[60],"et":[61],"al":[62],"[1].":[63],"also":[65],"new":[68],"with":[70],"running":[71],"[Formula:":[73],"see":[74],"text].":[75]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}