Examples in This Manual

IBM ILOG Scheduler User's Manual > Meet IBM ILOG Scheduler > Using This Manual > Examples in This Manual

Examples in This Manual

With minor variations, each example adheres to the following format.

The chapter starts with a discussion of the main concepts illustrated by the example.
The introduction is followed by a precise description of the problem to be solved. This description resembles the sort of verbal description that you should write before you design the model for your own problem.
Next is a presentation of the proposed solution, generally divided in two sections. The first section is for the definition of the problem and the design of an appropriate model; the second section is for the problem solution.

This division into problem definition and problem solution reflects the well-known constraint programming principle that urges a clean separation between the two. We strongly encourage you to follow this principle.

Next, the entire program is listed, along with the solutions to a few instances of the problem.
In summary, a few remarks conclude the example solution under consideration.

In case you prefer studying code online, the entire source for every example is provided in the standard distribution of Scheduler. The following table indicates the C++ file that corresponds to each example.

Table 1 Examples Presented in this Manual
Example	PC source	Link to Example
Getting Started with Scheduler
Using the Building Blocks (first example)	gsBasic.cpp	gsBasic
Using the Building Blocks (second example)	gsUnary.cpp	gsUnary
Using Discrete Resources (first example)	gsDisc.cpp	gsDisc
Using Discrete Resources (second example)	gsBudget.cpp	gsBudget
Adding Transition Times	gsTTime.cpp	gsTTime
Adding Breaks	gsBreak.cpp	gsBreak
Adding Integral and Functional Constraints	gsEff.cpp	gsEff
Adding Alternative Resources	gsAlt.cpp	gsAlt
Using Reservoirs	gsReserv.cpp	gsReserv
Using Reservoirs	gsReserv.cpp	gsReserv
Using the Trace Facilities	gsTrace.cpp	gsTrace
Using the Trace Facilities	gsTrace.cpp	gsTrace
Advanced Concepts
Using Scheduler with Solver	greedy.cpp	greedy
More Advanced Problem Modeling with Concert Technology	cassign.cpp	cassign
Bridge Construction Scheduling	bridge.cpp	bridge
Job-Shop Scheduling (Minimize Makespan)	jobshopm.cpp	jopshopm
Dichotomizing Binary Search	jopshopd.cpp	jobshopd
Ship-Loading Scheduling	ship.cpp	ship
Ship-Loading Scheduling (Decompose Problem)	shipdec.cpp	shipdec
Moving Activities from Discrete to Unary Resources	assign.cpp	assign
Moving Activities from Discrete to Unary Resources	assign.cpp	assign
Working with Transition Times	jobshopt.cpp	jobshopt
Using Transition Times and Costs	tcost.cpp	tcost
Strong Propagation on Reservoirs using the Balance Constraint	balpos.cpp	balpos
Scheduling with State Resources	trolley1.cpp	trolley1
Scheduling with Durable Resources	durable.cpp	durable
Using Trace on an Overconstrained Problem	relgreed.cpp	relgreed
Local Search in Scheduler
Job-Shop Problem with Shuffling	jobshopshuf.cpp	jobshopshuf
Tabu Job-Shop Problem	jobshopn1.cpp	jobshopn1
Tabu Job-Shop Problem with Alternatives	altls.cpp	altls
Large Neighborhood Search for the Jobshop Problem with Alternatives	altlns.cpp	altlns
Integrated Applications
Randomizing Algorithm	jobshopr.cpp	jobshopr
Handling Overconstrained Problem	bridgeov.cpp	bridgeov
Extending Transition Cost Usage	maintain.cpp	maintain
Scheduling with State Resources with Transition Times	trolley2.cpp	trolley2
Scheduling with State Resources with Transition Times and Limited Capacity	trolley3.cpp	trolley3
Representation of Time-Varying Capacity	capvar.cpp	capvar
Scheduling with Alternative Resources	alttext.cpp	alttext
Incremental Scheduling: Using Multiple Problem SubModels	resched2.cpp	resched2
Writing Multi-Threaded Applications with Durable Resources	durablem.cpp	durablem

PREVIOUS NEXT