{"id":"https://openalex.org/W4367049004","doi":"https://doi.org/10.1080/01605682.2023.2203150","title":"On scheduling of step-improving jobs to minimize the total weighted completion time","display_name":"On scheduling of step-improving jobs to minimize the total weighted completion time","publication_year":2023,"publication_date":"2023-04-26","ids":{"openalex":"https://openalex.org/W4367049004","doi":"https://doi.org/10.1080/01605682.2023.2203150"},"language":"en","primary_location":{"id":"doi:10.1080/01605682.2023.2203150","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2023.2203150","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","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/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":false,"raw_author_name":"T.C.E. Cheng","raw_affiliation_strings":["PolyU Business School, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PolyU Business School, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031880704","display_name":"Svetlana A. Kravchenko","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Svetlana A. Kravchenko","raw_affiliation_strings":["ArasCorp Development Center, Minsk, Belarus"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ArasCorp Development Center, Minsk, Belarus","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":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Bertrand M.T. Lin","raw_affiliation_strings":["Institute of Information Management, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information Management, National Yang Ming Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053249974"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":null,"apc_paid":null,"fwci":1.7646,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.86043649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"75","issue":"4","first_page":"720","last_page":"730"},"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.991599977016449,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9733999967575073,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.600654661655426},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.59014892578125},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.561783492565155},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5548586845397949},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.539198637008667},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4927425682544708},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.46830475330352783},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.44671085476875305},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4103761911392212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3380553722381592},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31594496965408325},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.1234399676322937}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.600654661655426},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.59014892578125},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.561783492565155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5548586845397949},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.539198637008667},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4927425682544708},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.46830475330352783},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.44671085476875305},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4103761911392212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3380553722381592},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31594496965408325},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.1234399676322937},{"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/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/01605682.2023.2203150","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2023.2203150","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:tjorxx:v:75:y:2024:i:4:p:720-730","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/01605682.2023.2203150","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":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.46000000834465027}],"awards":[{"id":"https://openalex.org/G2705071607","display_name":null,"funder_award_id":"MOST110-2410-H-A49-020-MY2","funder_id":"https://openalex.org/F2461203286","funder_display_name":"National Science and Technology Council"}],"funders":[{"id":"https://openalex.org/F2461203286","display_name":"National Science and Technology Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1967121062","https://openalex.org/W1988328380","https://openalex.org/W2003072117","https://openalex.org/W2012767650","https://openalex.org/W2039692353","https://openalex.org/W2048590534","https://openalex.org/W2136658137","https://openalex.org/W2165212506","https://openalex.org/W3005088032","https://openalex.org/W3147259487"],"related_works":["https://openalex.org/W2092966558","https://openalex.org/W1956651153","https://openalex.org/W1984267569","https://openalex.org/W2347561926","https://openalex.org/W2315766899","https://openalex.org/W2327547880","https://openalex.org/W2002944882","https://openalex.org/W3153517983","https://openalex.org/W210339300","https://openalex.org/W2983653348"],"abstract_inverted_index":{"Kim":[0],"et":[1],"al.":[2],"(2022)":[3],"studied":[4],"single-machine":[5],"scheduling":[6],"of":[7,98,109,116,120],"step-improving":[8],"jobs":[9,60,71],"with":[10],"a":[11,25,83,104,110],"common":[12],"discount":[13,41],"factor":[14],"to":[15,28],"minimize":[16],"the":[17,30,35,40,57,64,68,75,96,107,113,117],"total":[18],"weighted":[19],"completion":[20],"time.":[21],"This":[22],"study":[23],"proposes":[24],"pseudo-polynomial":[26,94],"algorithm":[27,87],"solve":[29],"problem.":[31],"We":[32],"then":[33],"consider":[34],"general":[36],"problem":[37],"in":[38,55,63,74,123],"which":[39,56],"factors":[42],"are":[43,61,72],"job":[44,100,111,122,126],"dependent.":[45],"It":[46],"is":[47,51,88,93,101,112],"proven":[48],"that":[49],"there":[50],"an":[52],"optimal":[53],"solution":[54,86],"early":[58],"normal":[59],"sequenced":[62,73],"WSPT":[65,76,81],"order":[66],"and":[67],"late":[69],"discounted":[70],"order.":[77],"Based":[78],"on":[79],"two":[80,118,124],"lists,":[82],"dynamic":[84],"programming":[85],"proposed.":[89],"The":[90],"run":[91],"time":[92],"when":[95],"distance":[97,108],"any":[99],"bounded":[102],"by":[103],"constant,":[105],"where":[106],"absolute":[114],"difference":[115],"positions":[119],"this":[121],"WSPT-ordered":[125],"lists.":[127]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-14T06:11:07.267592","created_date":"2025-10-10T00:00:00"}