• DocumentCode
    515141
  • Title

    An optimization model and its complexity on liner scheduling problem with customer choice

  • Author

    Song, Haiqing

  • Author_Institution
    Lingnan Coll., Sun Yat-sen Univ., Guangzhou, China
  • Volume
    2
  • fYear
    2010
  • fDate
    9-10 Jan. 2010
  • Firstpage
    775
  • Lastpage
    778
  • Abstract
    In this paper, we study the liner scheduling problem with consideration of the customer choice which depends on the transportation time of a route. We provide a mixed integer model for the problem and show that it is NP-complete. We then provide two ideas on solving this model.
  • Keywords
    goods distribution; optimisation; scheduling; NP complete; customer choice; liner scheduling problem; mixed integer model; optimization model; transportation time; Costs; Educational institutions; Electronic mail; Iterative algorithms; Marine vehicles; Processor scheduling; Routing; Strategic planning; Sun; Transportation; Customer Choice; Liner Scheduling; NP-Complete;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logistics Systems and Intelligent Management, 2010 International Conference on
  • Conference_Location
    Harbin
  • Print_ISBN
    978-1-4244-7331-1
  • Type

    conf

  • DOI
    10.1109/ICLSIM.2010.5461080
  • Filename
    5461080
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=515141