In this paper, we consider a variant of relocation problem, which originated from Public Housing Projects in Boston area. In the relocation problem, there is a set of h jobs to be processed on a single machine without preemptions. Each job demands, from the resource pool, a fixed amount of resources for its processing and returns some amount of resources to the pool at its completion. The number of resources returned by a job is not necessarily equal to that demanded. The minimum resource requirement is the number of resources that should be initially stored in the pool such that all jobs can be successfully completed. Relocation problem seeks to find a schedule which guarantees the minimum resource requirements. The question we investigate here relates to the flexibility, for decision makers, that a job can be left unprocessed. The goal is to find a job such that the resource requirement for scheduling the remaining jobs is minimized. Naive and efficient methods are proposed and discussed.
|Number of pages||6|
|Journal||Journal of the Operations Research Society of Japan|
|State||Published - Sep 1994|