Sequencing a set of alternatives under time constraints

Document Type

Article

Publication Date

1-1-1995

Abstract

We consider a problem of sequencing a set of alternatives (i.e. manufacturing methods, job applicants or target journals) available for selection to complete a project. Associated with each alternative are the probability of successful completion, the completion time, and the reward obtained upon successfully completing the alternative. The optimal sequencing strategy that maximizes the expected present value of total rewards, is derived based on a simple ordering parameter. We further consider an extension in which one of the alternatives will not be available for selection if not selected by a certain time, and another extension in which the selection process is allowed only for a limited period of time. We propose solution strategies to the selection and sequencing problem under time constraints. © 1995 Operational Research Society Ltd.

Publication Source (Journal or Book title)

Journal of the Operational Research Society

First Page

1133

Last Page

1144

This document is currently not available here.

Share

COinS