Accession Number : AD0715787

Title :   The Bicycle Problem.

Descriptive Note : Research rept.,

Corporate Author : CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Personal Author(s) : Masuda,Shinji

Report Date : OCT 1970

Pagination or Media Count : 67

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)

Descriptors :   (*LINEAR PROGRAMMING, *SCHEDULING), OPTIMIZATION, SET THEORY, THEOREMS

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE