3Hatoum K.M.,Chang Y L.Trade-off between lead time and price[J].Porduction Planning & Control,1997,8(2):158-172.
4Mendelson,H.,Whang,S.Optimal incentive compatible priority ricing for the M/M/1 queue[J].Operations Research,1990,38(5):870-883.
5Stalk G Jr.Time-the next source of competitive advantage[J].Harvard Business Review,1988,66(4):41-51.
6Marucheck A.S.,Mcclelland M.K.Strategic issues in make-in-order manufacturing [J].Production and Inventory Management,1996,2(4):23-95.
7Moorthy,S.,and Srinivasan,K.Signaling quality with a money-back guarantee:The role of transaction costs[J].Marketing Science,1995,14(4:442-466.
8Bhargara,H.,Sundaresan,S.Contingency pricing for information goods and services under industry wide performance standard[J].Journal of Management Information Systems,2003,20(2):113-136.
9Lax D.A.,and Sebenius,J.K.The manager as negotiator:Bargaining for cooperation and competitive gain[M].1986,Free Press.
10Bazerman,M.H.,and Gillespie,J.J.Betting on the future:The virtues of contingent contracts[J].Harvard Business Review,1999,77(5):155-160.
4PETERSEN J. Air freight industry - white paper [ J ]. Management ,2007 ( 1 ) : 1 - 46.
5PAK K, DEKKER R. Cargo revenue management:bid -prices for a 0 - 1 multi knapsack problem [ R ]. [ S. 1. ] : ERIM Report ERS - 2004 - 055 - LIS,2004.
6HAND L,TANG L C,HUANG H C. A Markov model for single -leg air cargo revenue management under a bid - price policy [ J ]. European Journal of Operational Research, 2010 (3) : 800 - 811.
7XIAO B C,YANG W. A revenue management model for products with two capacity dimensions [ J ]. European Journal of Operational Research,2010 (2) :412 - 421.
8LIMA E B, SHANTHIKUMAR J G. Relative entropy, exponential utility, and robust dynamic dricing [ J ]. Operations Research,2007,55 (2) : 198 - 214.
9HANSEN L P. Robustness [ M ]. [ S. 1. ] : Princeton University Press,2007:51 - 120.
10LEUNG Y W,WANG Y P. An orthogonal genetic algo- rithm with quantization for global numerical optimiza- tion [ J ]. IEEE Transactions on Evolutionary Com- puation,2001,5( 1 ) :41 -53.