Results 211 to 220 of about 2,827,333 (249)
Some of the next articles are maybe not open access.
Optimal Randomized Scheduling by Replacement
Journal of Combinatorial Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Optimal scheduling policies and the performance of the CDF scheduling
2014 48th Asilomar Conference on Signals, Systems and Computers, 2014We seek to characterize the performance of scheduling policies for wireless systems that are based on Cumulative Density Functions (CDF) of the channels. We first derive optimal scheduling policies for a two-user system under max-sum rate and max-min rate performance criteria subject to the same temporal resource constraints as those under CDF-based ...
PhuongBang C. Nguyen, Bhaskar Rao 0001
openaire +1 more source
On Optimal Processor Scheduling for Multiprogramming
SIAM Journal on Computing, 1973This paper investigates the problem of scheduling a processor to optimize throughput in a multiprogramming environment.
openaire +1 more source
Near-optimal multiprocessor scheduling
Proceedings of the 1992 ACM annual conference on Communications - CSC '92, 1992Problems in employing several processors to execute a program can be identified as: a) discovering the potential parallelism of execution in different portions of the same program, and b) scheduling of the resulting task system. This research concentrates on the latter problem.
Farideh A. Samadzadeh, George E. Hedrick
openaire +1 more source
An Optimal Drum Scheduling Algorithm
IEEE Transactions on Computers, 1972Suppose a set of N records must be read or written from a drum, fixed-head disk, or similar storage unit of a computer system. The records vary in length and are arbitrarily located on the surface of the drum. The problem considered here is to find an algorithm that schedules the processing of these records with the minimal total amount of rotational ...
openaire +2 more sources
Optimal scheduling of network consolidation
2007 IEEE Symposium on Computers and Communications, 2007To increase the capacity efficiency of provisioning oriented optical networks we have already proposed a three phase network development lifecycle, i.e. traditional provisioning phase and network extension phase extended with a consolidation phase [1]. Consolidation is a re-optimization and re-arrangement of the network on a certain extent.
Tamás Kárász +3 more
openaire +2 more sources
Optimal Scheduling of Fallible Inspections
Operations Research, 1996This paper gives the exact optimal solution to the problem of designing inspection schedules with fallible and time-consuming test procedures. The optimality criterion is designed to achieve a balance between the cost of inspections and the cost of undetected failure. The solution is derived in continuous time, with arbitrary failure distribution, and
openaire +3 more sources
Optimal Scheduling of Replacement and Inspection
Operations Research, 1963This paper summarizes research on the optimal scheduling of replacement and inspection for stochastically failing equipment, it is assumed that for some parts of the equipment, the state of the equipment—whether good or failed—is not known with certainty.
Jorgenson, Dale W., McCall, John J.
openaire +2 more sources
Cooling Schedules for Optimal Annealing
Mathematics of Operations Research, 1987A Monte Carlo optimization technique called “simulated annealing” is a descent algorithm modified by random ascent moves in order to escape local minima which are not global minima. The level of randomization is determined by a control parameter T, called temperature, which tends to zero according to a deterministic “cooling schedule.” We give a ...
openaire +2 more sources
Optimal stationary appointment schedules
Operations Research Letters, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kuiper, A., Mandjes, M., de Mast, J.
openaire +5 more sources