ILOG CPLEX 11.0 User's Manual > Discrete Optimization > Early Tardy Scheduling

Early Tardy Scheduling

This chapter shows you one way of using ILOG CPLEX to solve a scheduling problem. In it, you will see how to use logical constraints, piecewise linear functions, and aggressive MIP emphasis.

Describing the Problem
Understanding the Data File
Reading the Data
Creating Variables
Stating Precedence Constraints
Stating Resource Constraints
Representing the Piecewise Linear Cost Function
Transforming the Problem
Solving the Problem

This chapter walks through the C++ implementation. You can compare the Java implementation of the same model, using logical constraints, piecewise linear functions, and aggressive MIP emphasis in Etsp.java, and the C#.NET implementation in Etsp.cs, and the VB.NET implementation in Etsp.vb as well.

PREVIOUS NEXT