{"id":"https://openalex.org/W2029702444","doi":"https://doi.org/10.4304/jcp.5.6.922-926","title":"The Scheduling Model for Disabilities Transfer in Airports","display_name":"The Scheduling Model for Disabilities Transfer in Airports","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2029702444","doi":"https://doi.org/10.4304/jcp.5.6.922-926","mag":"2029702444"},"language":"en","primary_location":{"id":"doi:10.4304/jcp.5.6.922-926","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.5.6.922-926","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","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/A5000920029","display_name":"Xuejun Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xuejun Wu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000920029"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22012854,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"6","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.6707000136375427,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T11942","display_name":"Transportation and Mobility Innovations","score":0.6707000136375427,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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.5877808928489685},{"id":"https://openalex.org/keywords/transfer","display_name":"Transfer (computing)","score":0.48457372188568115},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.46214258670806885},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16907525062561035},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11101359128952026},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.073076993227005}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5877808928489685},{"id":"https://openalex.org/C2776175482","wikidata":"https://www.wikidata.org/wiki/Q1195816","display_name":"Transfer (computing)","level":2,"score":0.48457372188568115},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46214258670806885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16907525062561035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11101359128952026},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.073076993227005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jcp.5.6.922-926","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.5.6.922-926","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2530322880"],"abstract_inverted_index":{"The":[0],"difficulties":[1],"of":[2,28,31,43,79,95,103],"accessibility":[3],"still":[4],"exist":[5],"in":[6,50],"air":[7],"travel,":[8],"although":[9],"it":[10],"has":[11],"been":[12],"available":[13],"to":[14,22,69,99],"most":[15],"people":[16],"today.":[17],"This":[18,73],"paper":[19,54,74],"is":[20],"aiming":[21],"construct":[23],"an":[24],"economical":[25],"scheduling":[26,96],"algorithm":[27],"the":[29,40,47,56,76,93],"movement":[30],"wheelchairs":[32],"and":[33,38,106],"escorts":[34],"throughout":[35],"a":[36,66],"day,":[37],"find":[39,100],"minimum":[41,71,101],"budget":[42],"costs.":[44],"After":[45],"describing":[46],"general":[48],"situation":[49],"Epsilon":[51],"Company,":[52],"this":[53],"divided":[55],"costs":[57],"into":[58],"five":[59],"parts.":[60],"For":[61],"each":[62],"part,":[63],"we":[64,88],"established":[65],"cost":[67],"model":[68],"estimate":[70],"cost.":[72],"determined":[75],"optimal":[77],"position":[78],"pilling":[80],"up":[81],"wheel":[82,97,104],"chairs":[83,98,105],"via":[84],"geometrical":[85],"analysis.":[86],"And":[87],"carried":[89],"out":[90],"real-time":[91],"simulation":[92],"process":[94],"number":[102],"escorts.":[107]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}