完整後設資料紀錄
DC 欄位語言
dc.contributor.author周仕峰en_US
dc.contributor.authorChou, Shih-Fengen_US
dc.contributor.author許錫美en_US
dc.contributor.author洪暉智en_US
dc.date.accessioned2014-12-12T02:41:58Z-
dc.date.available2014-12-12T02:41:58Z-
dc.date.issued2013en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT070153343en_US
dc.identifier.urihttp://hdl.handle.net/11536/74940-
dc.description.abstractIn this study, we investigate two kinds of problem: (P1) a capacity allocation problem considering the space ratio between class 1 seat space and class 2 seat space, and uncertain demand with fixed total capacity to allocate the fixed capacity between two classes for maximizing the total expected revenue; (P2) the overbooking problems considering the customer behavior “no-shows” and uncertain demand with fixed total capacity to decide the booking level for each class for maximizing the total expected revenue. In P1 problem, we propose an optimal capacity allocation rule with decision tree approach and develop the procedure to find the optimal seat numbers for each class. In P2 problem, we derive the optimal overbooking rule with decision tree approach for only consider a single class. Then we extend the proposed approach to two fare classes. We develop solution procedures to find the optimal booking level for single class and two fare classes overbooking problem for maximizing expected total revenue respectively.zh_TW
dc.description.abstractIn this study, we investigate two kinds of problem: (P1) a capacity allocation problem considering the space ratio between class 1 seat space and class 2 seat space, and uncertain demand with fixed total capacity to allocate the fixed capacity between two classes for maximizing the total expected revenue; (P2) the overbooking problems considering the customer behavior “no-shows” and uncertain demand with fixed total capacity to decide the booking level for each class for maximizing the total expected revenue. In P1 problem, we propose an optimal capacity allocation rule with decision tree approach and develop the procedure to find the optimal seat numbers for each class. In P2 problem, we derive the optimal overbooking rule with decision tree approach for only consider a single class. Then we extend the proposed approach to two fare classes. We develop solution procedures to find the optimal booking level for single class and two fare classes overbooking problem for maximizing expected total revenue respectively.en_US
dc.language.isoen_USen_US
dc.subject資源分配zh_TW
dc.subject過量預定zh_TW
dc.subject營收管理zh_TW
dc.subjectCapacity allocationen_US
dc.subjectOverbookingen_US
dc.subjectRevenue managementen_US
dc.title航空產業考慮缺席和拒絕服務之?資源分配以及過量預定問題zh_TW
dc.titleAirline capacity allocation and overbooking problem ?with no-shows and denied serviceen_US
dc.typeThesisen_US
dc.contributor.department工業工程與管理系所zh_TW
顯示於類別:畢業論文