The Bicycle Problem.
Abstract
In the paper, one considers the so-called 'bicycle problem,' a scheduling problem which minimizes the travel time of n men assisted by a bicycle with carrying capacity 1. One finds here necessary conditions and sufficient conditions for optimality of a schedule. One also finds interesting examples which are simple but require countably many switch-offs to attain optimality. General conditions for optimality are proved for some cases and presented as a conjecture in general for this problem. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1970
- Accession Number
- AD0715787
Entities
People
- Shinji Masuda
Organizations
- University of California, Berkeley