Results 201 to 210 of about 2,827,333 (249)
Some of the next articles are maybe not open access.
On the optimality of linear schedules
Journal of VLSI signal processing systems for signal, image and video technology, 1989An algorithm can be modeled as a set of indexed computations, and a schedule is a mapping of the algorithm index space into time.Linear schedules are a special class of schedules that are described by a linear mapping and are commonly used in many systolic algorithms.Free schedules cause computations of an algorithm to execute as soon as their operands
Weijia Shang, José A. B. Fortes
openaire +1 more source
[1993] Proceedings IEEE International Conference on Robotics and Automation, 2002
The local optimality (LO) property for discrete event dynamic systems (DEDS) modeled using Petri nets (PNs) is presented. If a system is divided into independent subsystems and if the optimal behavior of these subsystems guarantees the optimal behavior of the whole system, then this system possesses the LO property.
Antonio Ramírez-Treviño +2 more
openaire +2 more sources
The local optimality (LO) property for discrete event dynamic systems (DEDS) modeled using Petri nets (PNs) is presented. If a system is divided into independent subsystems and if the optimal behavior of these subsystems guarantees the optimal behavior of the whole system, then this system possesses the LO property.
Antonio Ramírez-Treviño +2 more
openaire +2 more sources
On strictly optimal schedules for the cumulative cost-optimal scheduling problem
Computing, 1980Given a set ofn events (or jobs) which are constrained by a precedence relation, we want to order them into a totally ordered sequence (i. e., one machine schedule). Each event has an integer cost (which may be negative) associated with it, and our objective is to minimize the maximum cumulative cost within a schedule, i.
Hussein M. Abdel-Wahab, Tiko Kameda
openaire +2 more sources
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 +3 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
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 +3 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 +4 more sources