Journal
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume 64, Issue 1-3, Pages 153-164Publisher
ELSEVIER
DOI: 10.1016/S0925-5273(99)00054-7
Keywords
activity networks; scheduling; start times
Ask authors/readers for more resources
We treat the problem of sequencing n activities on a single facility with the objective of determining their start times to maximize an economic gain, subject to restrictions on their availabilities. The activities possess random durations. We present a dynamic programming model that determines the optimal value and yields the desired start times, which also imply the optimal sequence. An approximation is also offered to lighten the computing burden somewhat. (C) 2000 Elsevier Science B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available