Journal
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume 74, Issue 1-3, Pages 103-113Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0925-5273(01)00111-6
Keywords
sequencing; one processor; stochastic durations; release time; due dated jobs
Ask authors/readers for more resources
We treat the problem of the optimal release time of a set of n jobs en masse to satisfy individual due dates and confidence levels under various objective functions. We propose a dynamic programming approach that has general applicability to single and multiple processors. We provide some dominance relations that should alleviate the computing burden which, in the worst case, is of time complexity O(n2(n)). Three special cases (same confidence level for all jobs; same due date for all jobs; and the 'hierarchical case) are immediate consequences of our general model. (C) 2001 Elsevier Science BY. 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