The BicycleWalk01.lng Model

A one machine sequencing problem

View the model

Download the model

A one machine sequencing problem, also known as the walking + biking problem. Given one bicycle, and N persons, and a distance they all must cover, starting at the same time, how much time should each person spend walking and biking so they all cover the distance in minimum time; Ref: Chvatal, V.(1983), "On the Bicycle Problem," Discrete Applied Mathematics, North-Holland Publishing Company, 5 165-173

Keywords:

Scheduling | Sequencing | LINGO | Bicycle | Biking | Chvatal | One machine | Walking |