Results 251 to 260 of about 375,660 (286)
Some of the next articles are maybe not open access.
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
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 +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 +1 more source
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 +2 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 +4 more sources
American Economic Journal: Microeconomics
We consider a decision-maker sequentially choosing among alternatives when periodic payoffs depend on both chosen and unchosen alternatives in that period. We show that when flow payoffs are the sum or product of payoffs from chosen and unchosen alternatives, the optimal policy is an index policy. We characterize key properties of the optimal dynamics
Kfir Eliaz +2 more
openaire +1 more source
We consider a decision-maker sequentially choosing among alternatives when periodic payoffs depend on both chosen and unchosen alternatives in that period. We show that when flow payoffs are the sum or product of payoffs from chosen and unchosen alternatives, the optimal policy is an index policy. We characterize key properties of the optimal dynamics
Kfir Eliaz +2 more
openaire +1 more source
2018
Aiming at how to improve the efficiency of logistics transportation, taking into account the main constraints of road conditions and the number of commodity vehicles to be transported, proposed a path scheduling algorithm based on path functionalization. That is, the scheduling optimization of the path is regarded as a process scheduling.
Changchun Dong, Liang Zhou
openaire +1 more source
Aiming at how to improve the efficiency of logistics transportation, taking into account the main constraints of road conditions and the number of commodity vehicles to be transported, proposed a path scheduling algorithm based on path functionalization. That is, the scheduling optimization of the path is regarded as a process scheduling.
Changchun Dong, Liang Zhou
openaire +1 more source
Scheduling task graphs optimally with A*
The Journal of Supercomputing, 2010Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelisation. Due to the NP-hard nature of the task scheduling problem, scheduling algorithms are based on heuristics that try to produce good rather than optimal schedules. Nevertheless, in certain situations it is desirable to have optimal schedules, for example
Ahmed Zaki Semar Shahul, Oliver Sinnen
openaire +1 more source