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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
