Railway crew scheduling: Models, methods and applications

The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers develop...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Heil, Julia [verfasserIn] Hoffmann, Kirsten [verfasserIn] Buscher, Udo [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2019

Schlagwörter:	Operations Research
Schlagwörter:	Transportation Railway Crew scheduling Literature review

Übergeordnetes Werk:	Enthalten in: European journal of operational research - Amsterdam [u.a.] : Elsevier, 1977, 283, Seite 405-425
Übergeordnetes Werk:	volume:283 ; pages:405-425

DOI / URN:	10.1016/j.ejor.2019.06.016

Katalog-ID:	ELV003500292

Internformat


LEADER	01000caa a22002652 4500
001	ELV003500292
003	DE-627
005	20230524154032.0
007	cr uuu---uuuuu
008	230430s2019 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1016/j.ejor.2019.06.016 \|2 doi
035			\|a (DE-627)ELV003500292
035			\|a (ELSEVIER)S0377-2217(19)30491-6
040			\|a DE-627 \|b ger \|c DE-627 \|e rda
041			\|a eng
084			\|a 85.03 \|2 bkl
100	1		\|a Heil, Julia \|e verfasserin \|4 aut
245	1	0	\|a Railway crew scheduling: Models, methods and applications
264		1	\|c 2019
336			\|a nicht spezifiziert \|b zzz \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time re-scheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules.
650		7	\|8 1.1\x \|a Operations Research \|0 (DE-2867)15483-0 \|2 stw
650		4	\|a Transportation
650		4	\|a Railway
650		4	\|a Crew scheduling
650		4	\|a Literature review
700	1		\|a Hoffmann, Kirsten \|e verfasserin \|4 aut
700	1		\|a Buscher, Udo \|e verfasserin \|4 aut
773	0	8	\|i Enthalten in \|t European journal of operational research \|d Amsterdam [u.a.] : Elsevier, 1977 \|g 283, Seite 405-425 \|h Online-Ressource \|w (DE-627)306713470 \|w (DE-600)1501061-2 \|w (DE-576)094058377 \|x 0377-2217 \|7 nnns
773	1	8	\|g volume:283 \|g pages:405-425
912			\|a GBV_USEFLAG_U
912			\|a SYSFLAG_U
912			\|a GBV_ELV
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_32
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_74
912			\|a GBV_ILN_90
912			\|a GBV_ILN_95
912			\|a GBV_ILN_100
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_150
912			\|a GBV_ILN_151
912			\|a GBV_ILN_224
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_702
912			\|a GBV_ILN_2003
912			\|a GBV_ILN_2004
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2015
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2025
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2034
912			\|a GBV_ILN_2038
912			\|a GBV_ILN_2044
912			\|a GBV_ILN_2048
912			\|a GBV_ILN_2049
912			\|a GBV_ILN_2050
912			\|a GBV_ILN_2056
912			\|a GBV_ILN_2059
912			\|a GBV_ILN_2061
912			\|a GBV_ILN_2064
912			\|a GBV_ILN_2065
912			\|a GBV_ILN_2068
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2112
912			\|a GBV_ILN_2113
912			\|a GBV_ILN_2118
912			\|a GBV_ILN_2122
912			\|a GBV_ILN_2129
912			\|a GBV_ILN_2143
912			\|a GBV_ILN_2147
912			\|a GBV_ILN_2148
912			\|a GBV_ILN_2152
912			\|a GBV_ILN_2153
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2336
912			\|a GBV_ILN_2507
912			\|a GBV_ILN_2522
912			\|a GBV_ILN_4035
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4242
912			\|a GBV_ILN_4251
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4333
912			\|a GBV_ILN_4334
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4393
936	b	k	\|a 85.03 \|j Methoden und Techniken der Betriebswirtschaft
936	s	n	\|a BIZ-10001 \|2 SKW
951			\|a AR
952			\|d 283 \|h 405-425

Indexfelder

author_variant	j h jh k h kh u b ub
matchkey_str	article:03772217:2019----::alaceshdlnmdlmtosn
hierarchy_sort_str	2019
bklnumber	85.03
publishDate	2019
allfields	10.1016/j.ejor.2019.06.016 doi (DE-627)ELV003500292 (ELSEVIER)S0377-2217(19)30491-6 DE-627 ger DE-627 rda eng 85.03 bkl Heil, Julia verfasserin aut Railway crew scheduling: Models, methods and applications 2019 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time re-scheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules. 1.1\x Operations Research (DE-2867)15483-0 stw Transportation Railway Crew scheduling Literature review Hoffmann, Kirsten verfasserin aut Buscher, Udo verfasserin aut Enthalten in European journal of operational research Amsterdam [u.a.] : Elsevier, 1977 283, Seite 405-425 Online-Ressource (DE-627)306713470 (DE-600)1501061-2 (DE-576)094058377 0377-2217 nnns volume:283 pages:405-425 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 85.03 Methoden und Techniken der Betriebswirtschaft BIZ-10001 SKW AR 283 405-425
spelling	10.1016/j.ejor.2019.06.016 doi (DE-627)ELV003500292 (ELSEVIER)S0377-2217(19)30491-6 DE-627 ger DE-627 rda eng 85.03 bkl Heil, Julia verfasserin aut Railway crew scheduling: Models, methods and applications 2019 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time re-scheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules. 1.1\x Operations Research (DE-2867)15483-0 stw Transportation Railway Crew scheduling Literature review Hoffmann, Kirsten verfasserin aut Buscher, Udo verfasserin aut Enthalten in European journal of operational research Amsterdam [u.a.] : Elsevier, 1977 283, Seite 405-425 Online-Ressource (DE-627)306713470 (DE-600)1501061-2 (DE-576)094058377 0377-2217 nnns volume:283 pages:405-425 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 85.03 Methoden und Techniken der Betriebswirtschaft BIZ-10001 SKW AR 283 405-425
allfields_unstemmed	10.1016/j.ejor.2019.06.016 doi (DE-627)ELV003500292 (ELSEVIER)S0377-2217(19)30491-6 DE-627 ger DE-627 rda eng 85.03 bkl Heil, Julia verfasserin aut Railway crew scheduling: Models, methods and applications 2019 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time re-scheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules. 1.1\x Operations Research (DE-2867)15483-0 stw Transportation Railway Crew scheduling Literature review Hoffmann, Kirsten verfasserin aut Buscher, Udo verfasserin aut Enthalten in European journal of operational research Amsterdam [u.a.] : Elsevier, 1977 283, Seite 405-425 Online-Ressource (DE-627)306713470 (DE-600)1501061-2 (DE-576)094058377 0377-2217 nnns volume:283 pages:405-425 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 85.03 Methoden und Techniken der Betriebswirtschaft BIZ-10001 SKW AR 283 405-425
allfieldsGer	10.1016/j.ejor.2019.06.016 doi (DE-627)ELV003500292 (ELSEVIER)S0377-2217(19)30491-6 DE-627 ger DE-627 rda eng 85.03 bkl Heil, Julia verfasserin aut Railway crew scheduling: Models, methods and applications 2019 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time re-scheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules. 1.1\x Operations Research (DE-2867)15483-0 stw Transportation Railway Crew scheduling Literature review Hoffmann, Kirsten verfasserin aut Buscher, Udo verfasserin aut Enthalten in European journal of operational research Amsterdam [u.a.] : Elsevier, 1977 283, Seite 405-425 Online-Ressource (DE-627)306713470 (DE-600)1501061-2 (DE-576)094058377 0377-2217 nnns volume:283 pages:405-425 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 85.03 Methoden und Techniken der Betriebswirtschaft BIZ-10001 SKW AR 283 405-425
allfieldsSound	10.1016/j.ejor.2019.06.016 doi (DE-627)ELV003500292 (ELSEVIER)S0377-2217(19)30491-6 DE-627 ger DE-627 rda eng 85.03 bkl Heil, Julia verfasserin aut Railway crew scheduling: Models, methods and applications 2019 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time re-scheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules. 1.1\x Operations Research (DE-2867)15483-0 stw Transportation Railway Crew scheduling Literature review Hoffmann, Kirsten verfasserin aut Buscher, Udo verfasserin aut Enthalten in European journal of operational research Amsterdam [u.a.] : Elsevier, 1977 283, Seite 405-425 Online-Ressource (DE-627)306713470 (DE-600)1501061-2 (DE-576)094058377 0377-2217 nnns volume:283 pages:405-425 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 85.03 Methoden und Techniken der Betriebswirtschaft BIZ-10001 SKW AR 283 405-425
language	English
source	Enthalten in European journal of operational research 283, Seite 405-425 volume:283 pages:405-425
sourceStr	Enthalten in European journal of operational research 283, Seite 405-425 volume:283 pages:405-425
format_phy_str_mv	Article
bklname	Methoden und Techniken der Betriebswirtschaft
institution	findex.gbv.de
topic_facet	Operations Research Transportation Railway Crew scheduling Literature review
isfreeaccess_bool	false
container_title	European journal of operational research
authorswithroles_txt_mv	Heil, Julia @@aut@@ Hoffmann, Kirsten @@aut@@ Buscher, Udo @@aut@@
publishDateDaySort_date	2019-01-01T00:00:00Z
hierarchy_top_id	306713470
id	ELV003500292
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV003500292</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230524154032.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230430s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.ejor.2019.06.016</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV003500292</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0377-2217(19)30491-6</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.03</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Heil, Julia</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Railway crew scheduling: Models, methods and applications</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time re-scheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="8">1.1\x</subfield><subfield code="a">Operations Research</subfield><subfield code="0">(DE-2867)15483-0</subfield><subfield code="2">stw</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Transportation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Railway</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Crew scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Literature review</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hoffmann, Kirsten</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Buscher, Udo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">European journal of operational research</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1977</subfield><subfield code="g">283, Seite 405-425</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)306713470</subfield><subfield code="w">(DE-600)1501061-2</subfield><subfield code="w">(DE-576)094058377</subfield><subfield code="x">0377-2217</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:283</subfield><subfield code="g">pages:405-425</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.03</subfield><subfield code="j">Methoden und Techniken der Betriebswirtschaft</subfield></datafield><datafield tag="936" ind1="s" ind2="n"><subfield code="a">BIZ-10001</subfield><subfield code="2">SKW</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">283</subfield><subfield code="h">405-425</subfield></datafield></record></collection>
author	Heil, Julia
spellingShingle	Heil, Julia bkl 85.03 stw Operations Research misc Transportation misc Railway misc Crew scheduling misc Literature review Railway crew scheduling: Models, methods and applications
authorStr	Heil, Julia
ppnlink_with_tag_str_mv	@@773@@(DE-627)306713470
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut
collection	elsevier
remote_str	true
illustrated	Not Illustrated
issn	0377-2217
topic_title	85.03 bkl Railway crew scheduling: Models, methods and applications 1.1\x Operations Research (DE-2867)15483-0 stw Transportation Railway Crew scheduling Literature review
topic	bkl 85.03 stw Operations Research misc Transportation misc Railway misc Crew scheduling misc Literature review
topic_unstemmed	bkl 85.03 stw Operations Research misc Transportation misc Railway misc Crew scheduling misc Literature review
topic_browse	bkl 85.03 stw Operations Research misc Transportation misc Railway misc Crew scheduling misc Literature review
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	European journal of operational research
hierarchy_parent_id	306713470
hierarchy_top_title	European journal of operational research
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)306713470 (DE-600)1501061-2 (DE-576)094058377
title	Railway crew scheduling: Models, methods and applications
ctrlnum	(DE-627)ELV003500292 (ELSEVIER)S0377-2217(19)30491-6
title_full	Railway crew scheduling: Models, methods and applications
author_sort	Heil, Julia
journal	European journal of operational research
journalStr	European journal of operational research
lang_code	eng
isOA_bool	false
recordtype	marc
publishDateSort	2019
contenttype_str_mv	zzz
container_start_page	405
class_local_iln	SKW:BIZ-10001
author_browse	Heil, Julia Hoffmann, Kirsten Buscher, Udo
container_volume	283
class	85.03 bkl
format_se	Elektronische Aufsätze
author-letter	Heil, Julia
doi_str_mv	10.1016/j.ejor.2019.06.016
normlink	(DE-2867)15483-0
normlink_prefix_str_mv	(DE-2867)15483-0
author2-role	verfasserin
title_sort	railway crew scheduling: models, methods and applications
title_auth	Railway crew scheduling: Models, methods and applications
abstract	The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time re-scheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules.
abstractGer	The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time re-scheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules.
abstract_unstemmed	The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time re-scheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules.
collection_details	GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393
title_short	Railway crew scheduling: Models, methods and applications
remote_bool	true
author2	Hoffmann, Kirsten Buscher, Udo
author2Str	Hoffmann, Kirsten Buscher, Udo
ppnlink	306713470
mediatype_str_mv	c
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1016/j.ejor.2019.06.016
up_date	2024-07-06T19:49:59.153Z
_version_	1803860468464353280
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV003500292</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230524154032.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230430s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.ejor.2019.06.016</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV003500292</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0377-2217(19)30491-6</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.03</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Heil, Julia</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Railway crew scheduling: Models, methods and applications</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time re-scheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="8">1.1\x</subfield><subfield code="a">Operations Research</subfield><subfield code="0">(DE-2867)15483-0</subfield><subfield code="2">stw</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Transportation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Railway</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Crew scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Literature review</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hoffmann, Kirsten</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Buscher, Udo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">European journal of operational research</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1977</subfield><subfield code="g">283, Seite 405-425</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)306713470</subfield><subfield code="w">(DE-600)1501061-2</subfield><subfield code="w">(DE-576)094058377</subfield><subfield code="x">0377-2217</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:283</subfield><subfield code="g">pages:405-425</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.03</subfield><subfield code="j">Methoden und Techniken der Betriebswirtschaft</subfield></datafield><datafield tag="936" ind1="s" ind2="n"><subfield code="a">BIZ-10001</subfield><subfield code="2">SKW</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">283</subfield><subfield code="h">405-425</subfield></datafield></record></collection>
score	7.4000044

Nicht das Richtige dabei?

Schreiben Sie uns!

Railway crew scheduling: Models, methods and applications

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?