{"id":"https://openalex.org/W7225754684","doi":"https://doi.org/10.1080/0305215x.2026.2755734","title":"Column generation-based algorithm for preemptive relaxation formulation of coordinated seru scheduling and distribution problems","display_name":"Column generation-based algorithm for preemptive relaxation formulation of coordinated seru scheduling and distribution problems","publication_year":2026,"publication_date":"2026-11-10","ids":{"openalex":"https://openalex.org/W7225754684","doi":"https://doi.org/10.1080/0305215x.2026.2755734"},"language":"en","primary_location":{"id":"doi:10.1080/0305215x.2026.2755734","doi":"https://doi.org/10.1080/0305215x.2026.2755734","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0305215x.2026.2755734","pdf_url":null,"source":{"id":"https://openalex.org/S139857051","display_name":"Engineering Optimization","issn_l":"0305-215X","issn":["0305-215X","1026-745X","1029-0273"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Engineering Optimization","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5062079663","display_name":"Zhe Zhang","orcid":"https://orcid.org/0000-0001-8029-9679","observed_orcids":["https://orcid.org/0000-0001-8029-9679","https://orcid.org/0009-0001-8471-9885"]},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhe Zhang","raw_affiliation_strings":["Nanjing University of Science and Technology"],"raw_orcid":"https://orcid.org/0000-0001-8029-9679","affiliations":[{"raw_affiliation_string":"Nanjing University of Science and Technology","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121269036","display_name":"Xiaoling Song","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoling Song","raw_affiliation_strings":["Nanjing University of Science and Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Science and Technology","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5161410504","display_name":"Yong Yin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I133984924","display_name":"Doshisha University","ror":"https://ror.org/01fxdkm29","country_code":"JP","type":"education","lineage":["https://openalex.org/I133984924"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yong Yin","raw_affiliation_strings":["Doshisha University, Karasuma-Imadegawa, Kamigyo-ku"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Doshisha University, Karasuma-Imadegawa, Kamigyo-ku","institution_ids":["https://openalex.org/I133984924"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062079663"],"corresponding_institution_ids":["https://openalex.org/I36399199"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9951000213623047,"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.9951000213623047,"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.000699999975040555,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.760699987411499},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7336999773979187},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6488000154495239},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.626800000667572},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5626999735832214},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.484499990940094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4603999853134155},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.4296000003814697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42719998955726624},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.41519999504089355},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.41449999809265137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41280001401901245},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.40310001373291016},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3522000014781952},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3303000032901764},{"id":"https://openalex.org/C2780554755","wikidata":"https://www.wikidata.org/wiki/Q955260","display_name":"Relaxation technique","level":3,"score":0.30570000410079956},{"id":"https://openalex.org/C44104985","wikidata":"https://www.wikidata.org/wiki/Q492886","display_name":"Supply chain management","level":3,"score":0.2685999870300293},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/0305215x.2026.2755734","doi":"https://doi.org/10.1080/0305215x.2026.2755734","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0305215x.2026.2755734","pdf_url":null,"source":{"id":"https://openalex.org/S139857051","display_name":"Engineering Optimization","issn_l":"0305-215X","issn":["0305-215X","1026-745X","1029-0273"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Engineering Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":75,"referenced_works":["https://openalex.org/W104154533","https://openalex.org/W1970355999","https://openalex.org/W2015772023","https://openalex.org/W2018735909","https://openalex.org/W2065381746","https://openalex.org/W2140141330","https://openalex.org/W2143984912","https://openalex.org/W2148301389","https://openalex.org/W2255734301","https://openalex.org/W2256297400","https://openalex.org/W2344946706","https://openalex.org/W2432657622","https://openalex.org/W2473874545","https://openalex.org/W2582278447","https://openalex.org/W2586697371","https://openalex.org/W2768739795","https://openalex.org/W2947153091","https://openalex.org/W2975881734","https://openalex.org/W3003314034","https://openalex.org/W3004486791","https://openalex.org/W3007430882","https://openalex.org/W3008226559","https://openalex.org/W3027599221","https://openalex.org/W3103877605","https://openalex.org/W3131203918","https://openalex.org/W3157239425","https://openalex.org/W3171873908","https://openalex.org/W3196179151","https://openalex.org/W3200263602","https://openalex.org/W3215162205","https://openalex.org/W4200081635","https://openalex.org/W4200270072","https://openalex.org/W4200481023","https://openalex.org/W4205859754","https://openalex.org/W4211237573","https://openalex.org/W4225469647","https://openalex.org/W4232979508","https://openalex.org/W4241673740","https://openalex.org/W4246069459","https://openalex.org/W4307837968","https://openalex.org/W4311049526","https://openalex.org/W4316654766","https://openalex.org/W4367318997","https://openalex.org/W4377141886","https://openalex.org/W4377821221","https://openalex.org/W4379115102","https://openalex.org/W4385989275","https://openalex.org/W4386318401","https://openalex.org/W4386319113","https://openalex.org/W4387694283","https://openalex.org/W4388372089","https://openalex.org/W4388819163","https://openalex.org/W4389454692","https://openalex.org/W4391540447","https://openalex.org/W4391897153","https://openalex.org/W4406037470","https://openalex.org/W4406166195","https://openalex.org/W4407913914","https://openalex.org/W4408083735","https://openalex.org/W4411244560","https://openalex.org/W4411729963","https://openalex.org/W4412733421","https://openalex.org/W4415029517","https://openalex.org/W4416415528","https://openalex.org/W4416415975","https://openalex.org/W4417166519","https://openalex.org/W7114806521","https://openalex.org/W7128716392","https://openalex.org/W7131617368","https://openalex.org/W7135178216","https://openalex.org/W7140220193","https://openalex.org/W7140378962","https://openalex.org/W7147634428","https://openalex.org/W7166662778","https://openalex.org/W7203668731"],"related_works":[],"abstract_inverted_index":{"This":[0],"article":[1],"addresses":[2],"scheduling":[3,13],"problems":[4],"to":[5,92,112,116],"minimize":[6],"the":[7,57,66,87,99,107,121,125,141],"total":[8],"cost":[9],"for":[10],"coordinated":[11,101],"seru":[12,19],"and":[14,28,94,149,155],"distribution":[15],"problems,":[16],"in":[17,32,85],"which":[18,46,86],"is":[20,36,47,70,76,83,131,145,153],"a":[21,39,50,79],"creative":[22],"production":[23],"mode":[24],"originating":[25],"from":[26,106],"Japan":[27],"brings":[29],"inspiring":[30],"benefits":[31],"practice.":[33],"The":[34],"problem":[35,89,109],"formulated":[37],"as":[38],"general":[40],"0\u20131":[41],"integer":[42,52],"programming":[43,54],"model":[44,55],"G-(0,1),":[45,148],"reformulated":[48],"into":[49],"mixed":[51],"linear":[53],"by":[56,134],"preemptive":[58],"relaxation":[59],"formulation":[60,73],"PF-(MILP).":[61],"After":[62],"analysing":[63],"mathematical":[64],"properties,":[65],"proof":[67],"that":[68,140],"PF-(MILP)":[69,144],"an":[71],"exact":[72],"of":[74,124,143],"G-(0,1)":[75],"provided.":[77],"Subsequently,":[78],"column":[80,150],"generation-based":[81,151],"algorithm":[82,152],"designed,":[84],"master":[88,108],"assigns":[90],"jobs":[91],"serus,":[93],"independent":[95],"pricing":[96,129],"subproblems":[97],"determine":[98],"corresponding":[100],"optimal":[102],"schedule.":[103],"Dual":[104],"variables":[105],"are":[110],"employed":[111],"compute":[113],"reduced":[114],"costs":[115],"generate":[117],"new":[118],"columns.":[119],"Leveraging":[120],"Monge":[122],"property":[123],"coefficient":[126],"matrix,":[127],"each":[128],"subproblem":[130],"solved":[132],"efficiently":[133],"dynamic":[135],"programming.":[136],"Computational":[137],"experiments":[138],"indicate":[139],"performance":[142],"better":[146],"than":[147],"efficient":[154],"scalable.":[156]},"counts_by_year":[],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2026-11-11T00:00:00"}