English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70585/70585 (100%)
Visitors : 23086181      Online Users : 299
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29982


    Title: A network model for airline cabin crew scheduling
    Authors: Yan,SY;Tu,YP
    Contributors: 土木工程研究所
    Keywords: COLUMN GENERATION;PAIRING PROBLEM
    Date: 2002
    Issue Date: 2010-07-06 16:02:51 (UTC+8)
    Publisher: 中央大學
    Abstract: Airline crew scheduling problems have been traditionally formulated as set covering problems or set partitioning problems. When flight networks are extended, these problems become more complicated and thus more difficult to solve. From the current practic
    Relation: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
    Appears in Collections:[土木工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML443View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明