Car-sharing between two locations: online scheduling with flexible advance bookings

HIGHLIGHTS

• who: Kelin Luo and collaborators from the School of Management, Xi`an Jiaotong University, China have published the article: Car-Sharing between Two Locations: Online Scheduling with Flexible Advance Bookings, in the Journal: (JOURNAL)
• what: The authors focus on the special case of a single server. Although variable booking times provide much greater flexibility to customers, the authors show that the greedy algorithm is still optimal. The authors propose a Greedy Algorithm (GA) for the 1S2L-F problem, shown in Algorithm 1.
• future: A number of directions for future work arise from this . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.