University
of Cambridge
> Mathematics
> Statistical
Laboratory > Richard Weber
> Unsolved Problems
Unsolved Problems in OR
This page contains a list of open problems that I find
intriguing. They are not as difficult or as significant as the question
of whether P does or not equal NP. But these are problems that are easy
to state and understand, but whose solution has defied the efforts of
good researchers over a number of years. Most of these problems are in
the realm of stochastic optimization. I would love to see a solution to
any of these problems.
The bomber problem
See description
The rendezvous problem See description
Search for a moving target
See abstract
Non-preemptive release of stochastic jobs to
uniform machines See abstract
The unimportance of inserted idle time in
non-preemptive stochastic scheduling to minimize flow time on parallel
machines