IBM ILOG Scheduler User's Manual > Advanced Concepts > Working with Transition Times: the Job Shop Problem

Working with Transition Times: the Job Shop Problem

 INDEX Gray bullet PREVIOUS NEXT

There are many scheduling problems that include the definition of transition times between certain activities. Formally, we say that the transition time between two activities, A1 and A2, is the amount of time that must elapse between the end of A1, and the beginning of A2, when A1 precedes A2.

Transition times are highly problem-dependent, so in Scheduler you can define your own transition times by providing an instance of the class IloTransitionTime. This chapter shows you how to define the transition time function you want.

In this version of the job-shop problem, the activities have a transition type, and transition times are used on the resource when switching from one type of activity to another. The objective of the problem is to minimize the makespan. We use a dichotomizing binary-search strategy; this search algorithm is described in detail in A Dichotomizing Binary-Search Algorithm: the Job-Shop Problem.

© Copyright IBM Corp. 1987, 2009. Legal terms. PREVIOUS NEXT