By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Haiqing Song ; Lingnan Coll., Sun Yat-sen Univ., Guangzhou, China

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.

Published in:

Logistics Systems and Intelligent Management, 2010 International Conference on  (Volume:2 )

Date of Conference:

9-10 Jan. 2010