{"id":"https://openalex.org/W2587401452","doi":"https://doi.org/10.1109/smc.2016.7844729","title":"Column generation heuristics to airline crew scheduling problem for fair working time","display_name":"Column generation heuristics to airline crew scheduling problem for fair working time","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2587401452","doi":"https://doi.org/10.1109/smc.2016.7844729","mag":"2587401452"},"language":"en","primary_location":{"id":"doi:10.1109/smc.2016.7844729","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2016.7844729","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-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/A5016165967","display_name":"Yu Iijima","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yu Iijima","raw_affiliation_strings":["Graduate School of Engineering Science, Osaka University, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering Science, Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033193171","display_name":"Tatsushi Nishi","orcid":"https://orcid.org/0000-0003-1354-3939"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tatsushi Nishi","raw_affiliation_strings":["Graduate School of Engineering Science, Osaka University, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering Science, Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016165967"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":0.8467,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.80502338,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"003217","last_page":"003222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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/T10567","display_name":"Vehicle Routing Optimization Methods","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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9958000183105469,"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/column-generation","display_name":"Column generation","score":0.9259098768234253},{"id":"https://openalex.org/keywords/crew-scheduling","display_name":"Crew scheduling","score":0.8444004654884338},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.7024600505828857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.646798849105835},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6427809000015259},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6383017301559448},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.6231822371482849},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6033453941345215},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5586552619934082},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5343030691146851},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.520735502243042},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5078349709510803},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.49049967527389526},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.44442206621170044},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2063492238521576},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19601020216941833}],"concepts":[{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.9259098768234253},{"id":"https://openalex.org/C2776986690","wikidata":"https://www.wikidata.org/wiki/Q1139830","display_name":"Crew scheduling","level":3,"score":0.8444004654884338},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7024600505828857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.646798849105835},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6427809000015259},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6383017301559448},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.6231822371482849},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6033453941345215},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5586552619934082},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5343030691146851},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.520735502243042},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5078349709510803},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.49049967527389526},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.44442206621170044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2063492238521576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19601020216941833},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc.2016.7844729","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2016.7844729","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1984345688","https://openalex.org/W2004074846","https://openalex.org/W2007878129","https://openalex.org/W2017339608","https://openalex.org/W2021078654","https://openalex.org/W2033855616","https://openalex.org/W2038855278","https://openalex.org/W2042138197","https://openalex.org/W2050446204","https://openalex.org/W2071516917","https://openalex.org/W2077724649","https://openalex.org/W2083908390","https://openalex.org/W2083937470","https://openalex.org/W2118906428","https://openalex.org/W2124551024","https://openalex.org/W2128968951"],"related_works":["https://openalex.org/W2167580124","https://openalex.org/W2383016926","https://openalex.org/W2587401452","https://openalex.org/W2171830873","https://openalex.org/W2081493497","https://openalex.org/W1746476868","https://openalex.org/W4236278573","https://openalex.org/W2041182086","https://openalex.org/W2079109527","https://openalex.org/W2613933337"],"abstract_inverted_index":{"In":[0,80,97],"this":[1],"paper,":[2],"the":[3,24,73,77,84,87,98,101,111,116,119,138,148,154],"modeling":[4],"and":[5,38,43,115,147,150],"solution":[6,131],"strategies":[7],"of":[8,26,76,86,113,118],"a":[9,58,89,129,158],"practical":[10,33],"airline":[11,18],"crew":[12,19],"scheduling":[13,20],"problem":[14,21,54,61,156],"are":[15],"studied.":[16],"The":[17,53,65,123,133],"to":[22,71,82,127],"achieve":[23],"equalization":[25],"working":[27],"time":[28],"taking":[29],"into":[30],"account":[31],"for":[32,103],"constraints":[34,45],"such":[35],"as":[36,48,57],"international":[37],"domestic":[39],"flights,":[40],"holiday":[41],"assignments,":[42],"grouping":[44],"is":[46,55,69,95,106,125],"formulated":[47],"an":[49],"integer":[50],"programming":[51],"problem.":[52,79],"reformulated":[56],"set":[59],"partitioning":[60],"by":[62,109,157],"Dantzig-Wolfe":[63],"decomposition.":[64],"column":[66,90,120],"generation":[67,121],"algorithm":[68,140],"applied":[70],"solve":[72],"linear":[74],"relaxation":[75],"original":[78,155],"order":[81],"improve":[83],"performance":[85],"algorithm,":[88],"fixing":[91,112],"strategy":[92],"with":[93],"backtracking":[94,124],"proposed.":[96],"proposed":[99,139],"method,":[100],"schedule":[102],"all":[104],"crews":[105],"obtained":[107],"efficiently":[108],"exploiting":[110],"columns":[114],"execution":[117],"procedure.":[122],"introduced":[126],"find":[128,142],"feasible":[130],"efficiently.":[132],"computational":[134],"results":[135],"show":[136],"that":[137],"can":[141],"better":[143],"solutions":[144],"than":[145],"greedy-heuristics":[146],"branch":[149],"bound":[151],"procedure":[152],"solving":[153],"commercial":[159],"solver.":[160]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}