5,066 research outputs found
A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date
We address the single machine scheduling problem to minimize the total weighted earliness and tardiness about a nonrestrictive common due date. This is a basic problem with applications to the just-in-time manufacturing. The problem is linked to a Boolean programming problem with a quadratic objective function, known as the half-product. An approach to developing a fast fully polynomial-time approximation scheme (FPTAS) for the problem is identified and implemented. The running time matches the best known running time for an FPTAS for minimizing a half-product with no additive constan
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product
We address a version of the Half-Product Problem and its restricted variant with a linear knapsack constraint. For these minimization problems of Boolean programming, we focus on the development of fully polynomial-time approximation schemes with running times that depend quadratically on the number of variables. Applications to various single machine scheduling problems are reported: minimizing the total weighted flow time with controllable processing times, minimizing the makespan with controllable release dates, minimizing the total weighted flow time for two models of scheduling with rejection
Recommended from our members
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
We consider a scheduling problem on a single machine to minimize the makespan. The processing conditions are subject to cumulative deterioration, but can be restored by a single maintenance. We link the problem to the Subset-sum problem (if the duration of maintenance is constant) and to the Half-Product Problem (if the duration of maintenance depends on its start time). For both versions of the problem, we adapt the existing fully polynomial-time approximation schemes to our problems by handling the additive constants
Minimizing weighted mean absolute deviation of job completion times from their weighted mean
Cataloged from PDF version of article.We address a single-machine scheduling problem where the objective is to minimize the
weighted mean absolute deviation of job completion times from their weighted mean. This
problem and its precursors aim to achieve the maximum admissible level of service equity.
It has been shown earlier that the unweighted version of this problem is NP-hard in the
ordinary sense. For that version, a pseudo-polynomial time dynamic program and a 2-
approximate algorithm are available. However, not much (except for an important solution
property) exists for the weighted version. In this paper, we establish the relationship
between the optimal solution to the weighted problem and a related one in which the deviations
are measured from the weighted median (rather than the mean) of the job completion
times; this generalizes the 2-approximation result mentioned above. We proceed to
give a pseudo-polynomial time dynamic program, establishing the ordinary NP-hardness
of the problem in general. We then present a fully-polynomial time approximation scheme
as well. Finally, we report the findings from a limited computational study on the heuristic
solution of the general problem. Our results specialize easily to the unweighted case; they
also lead to an approximation of the set of schedules that are efficient with respect to both
the weighted mean absolute deviation and the weighted mean completion time.
2011 Elsevier Inc. All rights reserved
Recommended from our members
Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
We consider a fairly general model of “take-or-leave”decision-making. Given a number of items of a particular weight, the decision-maker either takes (accepts) an item or leaves (rejects) it. We design fully polynomial-time approximation schemes (FPTASs) for optimization of a non-separable non-linear function which depends on which items are taken and which are left. The weights of the taken items are subject to nested constraints. There is a noticeable lack of approximation results on integer programming problems with non-separable functions. Most of the known positive results address special forms of quadratic functions, and in order to obtain the corresponding approximation algorithms and schemes considerable technical difficulties have to be overcome. We demonstrate how for the problem under consideration and its modifications FPTASs can be designed by using (i) the geometric rounding techniques, and (ii) methods of K -approximation sets and functions. While the latter approach leads to a faster scheme, the running times of the of both algorithms compare favorably with known analogues for less general problems
FPTAS for half-products minimization with scheduling applications
Cataloged from PDF version of article.A special class of quadratic pseudo-boolean functions called “half-products” (HP) has recently been introduced. It has been
shown that HP minimization, while NP-hard, admits a fully polynomial time approximation scheme (FPTAS). In this note, we
provide a more efficient FPTAS. We further show how an FPTAS can also be derived for the general case where the HP function is
augmented by a problem-dependent constant and can justifiably be assumed to be nonnegative. This leads to an FPTAS for certain
partitioning type problems, including many from the field of scheduling.
c 2008 Elsevier B.V. All rights reserved
- …