ILOG
Welcome, Guest | Sign In


Blogs | Forums | Worldwide sites | Contact us

title element1
Product Info
Features
An introduction to CP technology
MP vs. CP
Join the discussions
Datasheet
Supported platforms
The ILOG Optimization Suite
Trial & Purchase
Academic sales
Contact info
ILOG OPL free trial
Related Products
ILOG OPL Development Studio
ILOG Optimization Decision Management System
ILOG CPLEX
ILOG CP
Features  

ILOG CP Optimizer has many advanced features to help you save time and increase efficiency.
Modeling features for detailed scheduling problems
Modeling features for discrete combinatorial optimization problems
Optimization engine
Interfaces

Modeling features for detailed scheduling problems

  • Optional tasks:
    • For modeling activities or processes that may or may not be executed in the final schedule
    • Tasks can be grouped to match the work breakdown structure of a problem
  • Precedence constraints:
    • Can model dependencies between tasks
    • Can include a delay
    • Can be applied to group of intervals
  • Expression on interval properties:
    • Express typical scheduling costs such as tardiness costs, completion costs or total duration
    • The presence status of an optional interval can be used to express completion costs or resource costs
    • Can be applied to group of intervals
  • Finite capacity reservoir and resources:
    • Specify limits on the number of tasks that can be performed in parallel with a common resources
    • Set constraints on inventory levels
  • Set-up times and batches

  • Calendars:
    • State that some tasks cannot start or end on some dates
    • State that some tasks that cannot overlap some dates
    • Define resource breaks
    • State that resource productivity changes over time
  • Resource states
  • Modeling features for discrete combinatorial optimization problems

  • Arithmetic linear and non-linear constraints
  • Logical constraints
  • Specialized constraints and expressions:
    • The all-different constraint: enforces uniqueness for each variable in an array
    • The pack constraint: packs items into containers with finite capacity in one dimension (time, weight, budget etc.)
    • The lexicographic constraint: enforces a lexical ordering between groups of decision variables and is convenient to break symmetries
    • The count expression
    • The standard deviation expression
  • Compatibility and incompatibility constraints:
    • Define possible assignments for arrays of decision variables. They can be used, for instance, to model allowed transitions in a sequencing problem.

    Optimization engine

    Interfaces

  • The Optimization Information Center
    The Right Hand Side
     
    Check out ILOG's optimization e-newsletter.
     
         
    ILOG CPLEX Workshop (INFORMS Pre-conference)
      11 October 2008
    INFORMS Annual Meeting 2008 - Washington D.C.
     
     
    Learn more
     
    element3