CREW PLANNING AT FLYING TIGER - A SUCCESSFUL APPLICATION OF INTEGER PROGRAMMING

被引:33
作者
MARSTEN, RE [1 ]
MULLER, MR [1 ]
KILLION, CL [1 ]
机构
[1] FLYING TIGER LINE,LOS ANGELES,CA 90009
关键词
D O I
10.1287/mnsc.25.12.1175
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This study provides a successful application of integer programming to the scheduling of flight crews for a cargo airline. The crew planning process is discussed, the role of the set partitioning model is explained, and representative computational experience is reported. The success of this application is shown to rest upon improved problem conceptualization decomposition rather than on any advances in solution techniques.
引用
收藏
页码:1175 / 1183
页数:9
相关论文
共 16 条
[1]  
Arabeyre J.P., 1969, TRANSPORTATION SCI, V3, P140, DOI 10.1287/trsc.3.2.140
[2]  
CUKIER A, TRIP COMPUTER PROGRA
[3]   SET-COVERING PROBLEM - NEW IMPLICIT ENUMERATION ALGORITHM [J].
ETCHEBERRY, J .
OPERATIONS RESEARCH, 1977, 25 (05) :760-772
[4]   SET-PARTITIONING PROBLEM - SET COVERING WITH EQUALITY CONSTRAINTS [J].
GARFINKEL, RS ;
NEMHAUSER, GL .
OPERATIONS RESEARCH, 1969, 17 (05) :848-+
[5]  
GARFINKEL RS, 1972, PERSPECTIVES OPTIMIZ
[6]  
GERBRACHT R, CAPS COMPUTER PROGRA
[7]  
GERBRACHT R, 1978, 18TH P AGIFORS S VAN
[8]   SET COVERING BY SINGLE-BRANCH ENUMERATION WITH LINEAR-PROGRAMMING SUBPROBLEMS [J].
LEMKE, CE ;
SALKIN, HM ;
SPIELBERG, K .
OPERATIONS RESEARCH, 1971, 19 (04) :998-+
[9]  
MAIMON A, ASPS COMPUTER PROGRA
[10]   ALGORITHM FOR LARGE SET PARTITIONING PROBLEMS [J].
MARSTEN, RE .
MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (05) :774-787