In this paper we give an overview of the current state of the graphical features provided by ILOG OPL Studio for debugging and performance tuning of OPL programs or external ILOG Solver based applications. This paper focuses on combining propagation and search information using the Search Tree view

duplication. The mathematical model is coded in CPLEX Optimisation Programming Language (OPL), a mathematical programming language of IBM ILOG CPLEX optimization studio and illustrated with a literature problem. The CPLEX solver provides optimal solution to the CF problem in a reasonable computational time.

making optimized scheduling available for many real-world problems for which the cost has so far been prohibitive. While this promise is still largely unrealized, some reconfigurable scheduling applications are making progress towards this goal. The best known and the standard setter is OPL Studio, a

. OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notations from modeling languages with a rich constraint language and the ability to specify search procedures and strategies

IBM, the IBM logo, and WebSphere are trademarks or registered trademarks of International Business Machines Corporation in the United States, other countries, or both. Other company, product, and service names may be trademarks or service marks of others. References in this publication to IBM products or services do not imply that IBM intends to make them available in all countries in which IBM operates.

and elements of international trade such as duties, duty drawbacks and currency effects. The model is integrated into a decision support system linking the optimization model developed using ILOG OPL 4.2/CPLX 10.0 to a visual user interface.

Abstract. This paper deals with three solvers for combinatorial problems: the commercial state-of-the-art solver Ilog OPL, and the research ASP systems DLV and SMODELS. The first goal of this research is to evaluate the relative performance of such systems, using a reproducible and extensible

This paper 1 deals with four solvers for combinatorial problems: the commercial state-of-the-art solver Ilog opl, and the research ASP systems dlv, smodels and cmodels. The first goal of this research is to evaluate the relative performance of such systems when used in a purely declarative way

solution for a loading and assembly plan selection problem in a mixed-model assembly system. The problem objective is to assign assembly-tasks and products to stations and to select assembly sequences so as to balance the station workloads. For the solution of the problem, ILOG-CPLEX optimization studio

an OPL model for IBM ILOG CP OPTIMIZER that implements a task priority-based preemptive scheduling, and apply it to a case study from the maritime and energy domain. Our validation shows that (1) the input to our model can be provided with reasonable effort in an industrial setting, and (2) the COP