1992
DOI: 10.1109/9.256408
|View full text |Cite
|
Sign up to set email alerts
|

Note on 'distributed scheduling based on due dates and buffer priorities' by S.H. Lu and P.R. Kumar

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

1993
1993
2009
2009

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 1 publication
0
3
0
Order By: Relevance
“…Better performance indicator of production cycle time leads to a better performance of hit rate. Lu and Kumar (1991) and Tang and Shi (1992) analyzed several dispatching rules and found that, when the average production cycle time and variance were decreased, the reliability of due‐date could be improved. Based on the above‐mentioned literature, smaller average production cycle time and variance would lead to better performance of hit rate.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Better performance indicator of production cycle time leads to a better performance of hit rate. Lu and Kumar (1991) and Tang and Shi (1992) analyzed several dispatching rules and found that, when the average production cycle time and variance were decreased, the reliability of due‐date could be improved. Based on the above‐mentioned literature, smaller average production cycle time and variance would lead to better performance of hit rate.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In [7], Kumar and Seidman study general issues in stability of FMS and introduce a universally stabilizing supervisory mechanism (USSM) that can stabilize any scheduling policy. In [8], Lu and Kumar prove stability for a class of policies whose aims are to optimize the performance of the FMS with respect to criteria such as the mean and variance of the total delay incurred in processing a part (other related work can be found in [9]). In [10], Humes introduces the use of "regulators"…”
Section: Literature Overviewmentioning
confidence: 99%
“…The work done in [1,15] provided the inspiration for this result. Note, however, that although the multiple-machine cases in [2], [7], [8], [9], [10], [11] and [3] consider a type of either serial or parallel production where parts can move from one machine to another one, they do not take into account the case where multiple machines can work together to service a set of part types at the same point in the system in the sense that we considered it here (e.g., via two or more processors processing in parallel task types from different buffers). To the best of our knowledge, the closest approach to the one studied in this dissertation can be found in pull production systems [14], where a set of M machines are working in parallel to serve a set of N buffers with a common input stream to a specific queue.…”
Section: Summary and Contributionsmentioning
confidence: 99%