Monma, C.L. and Sidney, J.B. (1987). Optimal sequencing via modular decomposition: Characterization of sequencing functions, Mathematics of Operations Research, 12, 22-31. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Risk-Sensitive Decision-Theoretic Troubleshooting - Shayman, Fernandez-Gaucherand (1999) (Correct)
....costs, both INF and MEF are classical problems that have been investigated over several decades. Various aspects of the INF problem have been considered by (among others) Bellman [4] 25] Dean [8] Kadane [20] Joyce [19] Garey [10] Simon and Kadane [32] Kadane and Simon [21] Monma and Sidney [26]. Work related to the MEF problem has been reported by (among others) Bellman [4] Staroverov [33] Greenberg [12] Matula [24] Black [6] Denby [9] Horn [14] Adolphson and Hu [1] Sidney [30] Stone [34] Hall [13] In this paper we concentrate on the MEF problem, when there are no ....
....discounting is employed, as illustrated in the following remark. Remark 1 In the special case where C i = D i ; 8i and fl 0 (risk seeking decision maker) the MEF problem without precedence constraints is mathematically equivalent to the total weighted exponential completion time problem [11, 26]. To obtain this equivalence, p i and C i are redefined to be the weight and processing time, respectively, for job i. Let (i; fl) E[e flC i ] and let (i; fl) E[e flD i ] Thus, i; fl) and (i; fl) are the moment generating functions of C i and D i , respectively. In the sequel, we ....
C. L. Monma and J. B. Sidney. Optimal sequencing via modular decomposition: Characterization of sequencing functions. Mathematics of Operations Research, 12(1):22--31, 1987.
Algorithms To Schedule Tasks With And/or Precedence Constraints - Gillies (1993) (6 citations) (Correct)
....constraints: ASI, SND, consistency and monotonicity. These rules generalize the work of [Monma79] and also provide an optimal solution to the 2 machine flow shop problem where the objective is to minimize maximum flow time. Several other applications are mentioned in [Sidney81] The work in [Monma87] recasts the algorithms of [Monma79] to handle job modules. Any directed graph that is not generalized series parallel is a job module; job modules can be composed using the rules for generalized series parallel graphs. The job modules of a graph can be found in O(n 2 ) time. Presumably, if the ....
Monma, Clyde L. and Jeffrey B. Sidney. Optimal sequencing Via Modular Decomposition: Characterization of Sequencing Functions. Mathematics of Operations Research (February 1987) vol. 12, no. 1, pp. 22-31.
Fault Management in Communication Networks: Test.. - Shayman.. (2000) Self-citation (Sidney) (Correct)
....expected sum of the testing costs, both INF and MEF are classical problems that have been investigated over several decades. Various aspects of the INF problem have been considered by (among others) Bellman [3] Kadane [11] Garey [6] Simon and Kadane [23] Kadane and Simon [12] Monma and Sidney [15]. Work related to the MEF problem has been reported by (among others) Bellman [3] Staroverov [24] Sidney [21] Stone [25] Consider the MEF problem and suppose that the probability p i that each component i is faulty is known from prior knowledge of the properties of the system together with ....
....optimal testing sequence in the unconstrained case. In the more general case where the sequence is constrained by an arbitrary partial order, we show that our model leads to modular decompositions of the optimality criterion, and therefore is amenable to study following work by Monma and Sidney [15]. At the root of our results is an interchange argument. That such an argument proves useful is somewhat surprising since scheduling problems that can be solved by interchange arguments in the risk neutral case are not necessarily amenable to such solution in the case of risk sensitive criterion ....
[Article contains additional citation context not shown here]
C. L. Monma and J. B. Sidney. Optimal sequencing via modular decomposition: Characterization of sequencing functions. Mathematics of Operations Research, 12(1):22--31, 1987.
Minimizing Nondecreasing Separable Objective Functions for the.. - Cheng, al. (2002) (Correct)
No context found.
Monma, C.L. and Sidney, J.B. (1987). Optimal sequencing via modular decomposition: Characterization of sequencing functions, Mathematics of Operations Research, 12, 22-31.
Sequencing Groups of Jobs under Precedence Constraints - Shafransky (2000) (Correct)
No context found.
Monma, C.L., Sidney, J.B.: Optimal sequencing via modular decomposition: Characterization of sequencing functions. Mathematics Oper. Res. (1987) 12, 22-31.
Risk-Sensitive Decision-Theoretic Diagnosis - Mark Shayman Department (2000) (Correct)
No context found.
C. L. Monma and J. B. Sidney. Optimal sequencing via modular decomposition: Characterization of sequencing functions. Mathematics of Operations Research, 12(1):22--31, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC