> 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
Example: etsp.cpp

Note

These logical constraint facilities are available in ILOG CPLEX only with Concert Technology for C++ users.

PREVIOUS NEXT