F. Ajili and H. El Sakkout. LP probing for piecewise linear optimization in scheduling. In Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'01), pages 189--203, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....used to identify promising values. Moreover, by exploiting the discrepancy structure of the method combined with reduced costs, suboptimality of subproblems can be proved very fast. Another hybrid approach using linear programming and constraint programming has been investigated by Ajili et al. [1] and El Sakkout et al. 6] A subset of constraints is relaxed as a linear program in such a way that its solution is always integral. The solution to the relaxation serves as a suggestion (a probe ) for solving the complete program using a constraint programming solver. A probe is used to detect ....

F. Ajili and H. El Sakkout. LP probing for piecewise linear optimization in scheduling. In Proc. of Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAI -OR'01), pages 189--203, 2001.

....3 ZLWK#WKH SUREHU ###3UREH#D D YLRODWHV#UHOD[HG KDUG FRQVWUDLQWV V ### UHDWH#FKRLFH#SRLQW #( 25 TM TM( # Fig. 1. An illustration of probe backtrack search though probe backtracking was used to hybridize BT CS with linear and mixed integer solvers, rather than with LS [1, 9]. In probe backtracking, a constraint satisfaction and optimization problem is solved by a high level BT CS algorithm that hybridizes another algorithm. All the problem constraints are classied into two sets: ieasyj and ihardj. The ieasyj constraints are those constraints that are easily solved ....

....can be found in [9] 1. 4 Application to Scheduling Dioeerent versions of probe backtrack search have been applied to commercial dynamic scheduling problems [9] to earliness tardiness scheduling problems [3] and to a generic scheduling problem extended with a piecewise linear objective function [1]. The latter is selected here as a testbed for the technique that is developed, because it generalizes the rst two. A similar evolution from integrating LP based methods towards other solvers has been discussed in [15] A super optimal assignment is a complete, partially consistent ....

[Article contains additional citation context not shown here]

F. Ajili and H. El Sakkout. LP probing for piecewise linear optimization in scheduling. In Proc. of CP-AI-OR'01, pages 189203, 2001.

....to satisfy complex and easily violated constraints. Thus, constraint satisfaction and local search may complement each other well. A typical large scale combinatorial optimization problem, the kernel resource feasibility problem, extended with a piecewise linear objective function (PLKRFP [1]) is selected here as a testbed for the technique that is developed. Its core is a general scheduling problem with many important application areas such as job shop scheduling, ship loading and bridge building. Furthermore, it can be clearly divided into dioeerent sub problems, and therefore it is ....

....violations are solved in the backtracking search tree by posting (or removing when backtracking) temporal precedence constraints to the temporal sub problem. Dioeerent versions of probe backtrack search have been applied successfully to commercial dynamic scheduling problems and to the PLKRFP [4, 1]. In [1] the iproberj algorithm solves the sub problem using linear programming (LP) and mixed integer programming (MIP) methods, whereas in local probing, local search is used instead. LP and MIP can be used when the problem can be modelled such that the objective function is linear or piecewise ....

[Article contains additional citation context not shown here]

F. Ajili and H. El Sakkout. Lp probing for piecewise linear optimization in scheduling. In Proc. of Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAI -OR'01), pages 189203, 2001.

No context found.

F. Ajili and H. El Sakkout. LP probing for piecewise linear optimization in scheduling. In Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'01), pages 189--203, 2001.

No context found.

F. Ajili and H. El Sakkout. LP probing for piecewise linear optimization in scheduling. In Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AIOR '01), pages 189--203, 2001.

No context found.

F. Ajili and H. El Sakkout. LP probing for piecewise linear optimization in scheduling. In Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AIOR '01), pages 189--203, 2001.

No context found.

F. Ajili and H. El Sakkout. LP probing for piecewise linear optimization in scheduling. In Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'01), pages 189--203, 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC