Results 241 to 250 of about 375,660 (286)
Some of the next articles are maybe not open access.
Asymptotically Optimal Appointment Schedules
Mathematics of Operations Research, 2019We consider the problem of scheduling appointments for a finite customer population to a service facility with customer no-shows to minimize the sum of customer waiting time and server overtime costs. Because appointments need to be scheduled ahead of time, we refer to this problem as an optimization problem rather than a dynamic control one. We study
Mor Armony, Rami Atar, Harsha Honnappa
openaire +2 more sources
Optimal Fault-Secure Scheduling
The Computer Journal, 1998Summary: We consider here two basic fault-secure scheduling problems for multiprocessor systems. First, given the number of processors in the system and a set of computational tasks of unit length expressed as a complete binary tree, a scheduling algorithm is proposed such that the total execution time is a minimum and no undetected single error result
Jie Wu 0001 +2 more
openaire +1 more source
Management Science, 2015
The dynamic assignment of patients to exam days in order to manage daily variations in demand and capacity is a long-standing open research area in appointment scheduling. In particular, the dynamic assignment of advance appointments has been considered to be especially challenging because of its high dimensionality.
openaire +1 more source
The dynamic assignment of patients to exam days in order to manage daily variations in demand and capacity is a long-standing open research area in appointment scheduling. In particular, the dynamic assignment of advance appointments has been considered to be especially challenging because of its high dimensionality.
openaire +1 more source
Optimal schedule for anthracyclines
European Journal of Cancer and Clinical Oncology, 1985Commentaire sur l'article de L'European. J. cancer. clin.
openaire +2 more sources
On the Optimality of Feautrier’s Scheduling Algorithm
Concurrency and Computation: Practice and Experience, 2002AbstractFeautrier's scheduling algorithm is the most powerful existing algorithm for parallelism detection and extraction, but it has always been known to be suboptimal. However, the question as to whether it may miss some parallelism because of its design has not been answered. We show that this is not the case.
openaire +3 more sources
LINEAR SCHEDULING IS NEARLY OPTIMAL
Parallel Processing Letters, 1991This paper deals with the problem of finding optimal schedulings for uniform dependence algorithms. Given a convex domain, let Tf be the total time needed to execute all computations using the free (greedy) schedule and let Tl be the total time needed to execute all computations using the optimal linear schedule.
Darte, Alain +2 more
openaire +2 more sources
Optimal Randomized Scheduling by Replacement
Journal of Combinatorial Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 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