-
作者：FISHMAN, GS
摘要：Several recent papers have suggested using a product estimator in Monte Carlo Markov chain sampling for estimating the volume of a convex body, the permanent of a matrix and the distribution of first-passage time for a positive recurrent Markov chain. The present paper analyzes the properties of this estimator when each replication starts in an arbitrarily selected state. In particular, it describes a procedure for determining optimal warm-up intervals and optimal sample sizes to achieve a spe...
-
作者：PATEROK, M; ETTL, M
作者单位：University of Erlangen Nuremberg
摘要：Scheduling strategies for real-time systems often employ semipreemptive priorities, allowing for a deadline enforcement by preemptive priorities while avoiding the overhead of unnecessary interrupts. A variety of these strategies can be described by preemption-distance priorities in a straightforward and flexible fashion. A preemption-distance is a globally assigned positive integer number. An arriving task must exceed the priority of the task being served by at least the preemption-distance t...
-
作者：DUENYAS, I
摘要：In a recent paper, L. M. Wein (1992) addressed the problem of scheduling a network of queues. Given a multistation, multiclass queueing network, the problem involves deciding when to release a job to the network as well as how to sequence jobs at each machine in the network to meet a desired throughput level. By approximating this problem by a control problem involving Brownian motion, Wein derived effective heuristics, which easily outperformed traditional work release and sequencing rules. H...
-
作者：CHENG, TCE; CHEN, ZL
摘要：We consider a problem of scheduling several batches of jobs on two identical parallel machines to minimize the total completion time of jobs. A setup time is incurred whenever there is a switch from processing a job in one batch to a job in another batch. When the number of jobs is arbitrary, the computational complexity of the problem is posed as an open problem in the literature. We show in this note that the problem is binary NP-hard even when the setup times are sequence independent and al...
