An Application of Wedelin's Method to Railway Crew Scheduling Problem-Reference-Cited by-同舟云学术

An Application of Wedelin's Method to Railway Crew Scheduling Problem

Published:2009 Issue:10 Volume:129 Page:1958-1967
ISSN:0385-4221
Container-title:IEEJ Transactions on Electronics, Information and Systems
language:en
Short-container-title:IEEJ Trans.EIS

Author:

Miura Rei¹,Imaizumi Jun²,Fukumura Naoto³,Morito Susumu¹

Affiliation:

1. School of Creative Science and Engineering, Waseda University

2. Faculty of Business Administration, Toyo Univeristy

3. Railway Technical Reseach Institute

Publisher

Institute of Electrical Engineers of Japan (IEE Japan)

Subject

Electrical and Electronic Engineering

Link

http://www.jstage.jst.go.jp/article/ieejeiss/129/10/129_10_1958/_pdf

Reference8 articles.

1. An algorithm for large scale 0–1 integer programming with application to airline crew scheduling

2. The design of a 0–1 integer optimizer and its application in the Carmen system

3. (3) A. Caprara, M. Monaci, and P. Toth: “A global method for crew planning in railway applications”, In S. Voß and J. R. Daduna, ed., Computer-Aided Scheduling of Public Transport, Lecture Notes in Economics and Mathematical Systems, pp. 17-36, Springer (2001)

4. (4) C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance: “Branch and price: column generation for solving huge integer programs”, Operations Research, Vol. 46, No. 3, pp. 316-329 (1998)

5. (5) C. Barnhart and A. Cohn: “Airline schedule planning: accomplishments and opportunities”, Manufacturing & Service Operations Management, Vol. 6, No. 1, pp. 3-22 (2004)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Crew Scheduling Algorithm for Minimizing the Required Number of Crew Members;IEEJ Transactions on Industry Applications;2024-05-01