PERT scheduling with convex cost functions
نویسندگان
چکیده
منابع مشابه
PERT scheduling with convex cost functions
This paper deals with the problem of ,nding a minimum cost schedule for a set of dependent activities when a convex cost function is attached to the starting time of each activity. A ,rst optimality necessary and su/cient condition bearing on the head and tail blocks of a schedule is ,rst established. A second such condition that uses the spanning active equality trees of a schedule leads to de...
متن کاملConvex Cost Functions
The concept of Support Vector Regression is extended to a more general class of convex cost functions. It is shown how the resulting convex constrained optimization problems can be eeciently solved by a Primal{Dual Interior Point path following method. Both computational feasibility and improvement of estimation is demonstrated in the experiments.
متن کاملConvex Relaxatoin Approach to Appointment Scheduling with Piecewise Linear Cost Functions
This note is concerned with the problem of scheduling a set of jobs with predetermined order on a single processor. The objective is to minimize the expected total cost incurred by job waiting and processor idling, where the job processing times are discrete random variables. We extend the scope of the discussion in Begen and Queyranne [2011] to piecewise linear cost functions. For piecewise li...
متن کاملOnline scheduling with general cost functions
We consider a general online scheduling problem on a single machine with the objective of minimizing ∑ j wjg(Fj), where wj is the weight/importance of job Jj , Fj is the flow time of the job in the schedule, and g is an arbitrary non-decreasing cost function. Numerous natural scheduling objectives are special cases of this general objective. We show that the scheduling algorithm Highest Density...
متن کاملConvex cost functions in blind equalization
Existing blind adaptive equalizers that use nonconvex cost functions and stochastic gradient descent suffer from lack of global convergence to an equalizer setup that removes sufficient IS1 when an FIR equalizer is used. In this paper, we impose convexity on the cost function and anchoring of the equalizer away from the all-zero setup. We establish that there exists a globally convergent blind ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00220-1