{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T11:05:33Z","timestamp":1770030333833,"version":"3.49.0"},"reference-count":16,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,8,11]]},"abstract":"<jats:p>As a key operation for the daily maintenance of electric multiple units (EMU), the first-level maintenance operation directly affects the utilization efficiency of the EMU. The fixed operation sequence of EMU trains, the limitation of the track capacity and inconsistent arrival time of EMU trains give rise to such problems as extended waiting time, idle tracks and waste of maintenance capacity. To solve these problems and optimize the assignment of EMU-to-track, we propose a flexible job-shop sequence scheduling (Flexible-JSS) mode for the first-level maintenance of EMU trains, and a flexible sequence and tracks sharing (FSTS) model for the first-level maintenance at electric multiple units depot (EMUD) has also been proposed in this paper. The FSTS model is designed to shorten the latest completion time after taking into account the constraints such as the train length, track capacity, the operation sequence of all EMU trains, the operation process of a single EMU train, and the train-set scheduling plan. A modified genetic algorithm is used to solve the model. The feasibility and effectiveness of the model and algorithm are verified by a real case, and the comparison with the other two fixed job-shop sequence scheduling (Fixed-JSS) modes proves that the Flexible-JSS mode can improve the efficiency and ability of the first-level maintenance at EMUD impressively.<\/jats:p>","DOI":"10.3233\/jifs-210823","type":"journal-article","created":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T14:15:33Z","timestamp":1624371333000},"page":"2145-2160","source":"Crossref","is-referenced-by-count":3,"title":["Model and algorithm for the first-level maintenance operation optimization of EMU trains"],"prefix":"10.1177","volume":"41","author":[{"given":"Peng","family":"Zhao","sequence":"first","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China"}]},{"given":"Baoming","family":"Han","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China"}]},{"given":"Dewei","family":"Li","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China"}]},{"given":"Yawei","family":"Li","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-210823_ref2","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.apm.2018.11.008","article-title":"A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem","volume":"67","author":"Qin","year":"2019","journal-title":"Applied Mathematical Modelling"},{"key":"10.3233\/JIFS-210823_ref4","unstructured":"Hansmann R.S. and Zimmermann U.T. , Optimal Sorting of Rolling Stock at HumpYards[M], Mathematics \u2013Key Technology for the Future, Springer Berlin Heidelberg, 2008."},{"key":"10.3233\/JIFS-210823_ref5","first-page":"102","article-title":"Model and algorithm for the Integrative Plan and Maintenance Plan","volume":"33","author":"Wang","year":"2012","journal-title":"China Railway Science"},{"key":"10.3233\/JIFS-210823_ref6","first-page":"1","article-title":"Model and algorithm for optimized formulation of scheduled shunting operation plans of electric multiple units depots","volume":"35","author":"Wang","year":"2013","journal-title":"Journal of the China Railway Society"},{"key":"10.3233\/JIFS-210823_ref7","doi-asserted-by":"crossref","first-page":"457","DOI":"10.4028\/www.scientific.net\/AMR.748.457","article-title":"Optimization on Resource-Constrained Multi-Project Scheduling of Electric Multiple Unit Overhaul","volume":"748","author":"Sun","year":"2013","journal-title":"Advanced Materials Research"},{"key":"10.3233\/JIFS-210823_ref8","first-page":"122","article-title":"Optimization Model and Solution Algorithm for the Shunting Schedule of Electrical Multiple Units Depot","volume":"16","author":"Wang","year":"2016","journal-title":"Journal of Transportation Systems Engineering and Information Technology"},{"key":"10.3233\/JIFS-210823_ref9","first-page":"1","article-title":"Optimizing the Shunting Schedule of Electric Multiple Units Depot Using an Enhanced Particle Swarm Optimization Algorithm","volume":"2016","author":"Wang","year":"2016","journal-title":"Computational Intelligence and Neuroscience"},{"key":"10.3233\/JIFS-210823_ref10","first-page":"117","article-title":"Optimization of Shunting Operation Plan of Electric Multiple Unit Running Shed","volume":"37","author":"Guo","year":"2016","journal-title":"China Railway Science"},{"key":"10.3233\/JIFS-210823_ref11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.cie.2017.03.031","article-title":"Optimal track utilization in electric multiple unit maintenance depots","volume":"108","author":"Li","year":"2017","journal-title":"Computers & Industrial Engineering"},{"key":"10.3233\/JIFS-210823_ref12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2019\/9120239","article-title":"Optimization of the Shunting Operation Plan at Electric Multiple Units Depots","volume":"8","author":"Shi","year":"2019","journal-title":"Journal of Advanced Transportation"},{"key":"10.3233\/JIFS-210823_ref14","first-page":"59","article-title":"Optimization of First-Level Maintenance Plan in EMUD based on Genetic Algorithm","volume":"38","author":"Tong","year":"2016","journal-title":"Railway Transport and Economy"},{"key":"10.3233\/JIFS-210823_ref15","doi-asserted-by":"crossref","unstructured":"Haahr , Lusby , Richard , et al., A Comparison of Optimization Methods for Solving the Depot Matching and Parking Problem, Social Science Electronic Publishing, 2015.","DOI":"10.2139\/ssrn.2675797"},{"key":"10.3233\/JIFS-210823_ref16","doi-asserted-by":"crossref","first-page":"1949","DOI":"10.1007\/s10845-020-01547-4","article-title":"A Research Survey: Heuristic Approaches for Solving Multi Objective Flexible Job Shop Problems","volume":"31","author":"T\u00fcrkylmaz","year":"2020","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.3233\/JIFS-210823_ref17","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","article-title":"A genetic algorithm for the Flexible Job-shop Scheduling Problem","volume":"35","author":"Pezzella","year":"2008","journal-title":"Computers & Operations Research"},{"key":"10.3233\/JIFS-210823_ref18","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1504\/IJMCP.2018.092339","article-title":"A multi-objective mathematical model and genetic algorithm for reliability analysis in flexible job-shop scheduling problem","volume":"2","author":"Aghajani","year":"2018","journal-title":"International Journal of Management Concepts & Philosophy"},{"key":"10.3233\/JIFS-210823_ref19","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.cie.2018.11.006","article-title":"Scatter search algorithm for the multiprocessor task job-shop scheduling problem","volume":"127","author":"Fan","year":"2019","journal-title":"Computers & Industrial Engineering"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-210823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:52:15Z","timestamp":1769993535000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-210823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,11]]},"references-count":16,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/jifs-210823","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,11]]}}}