Hi,
I try to apply cp model in integrated process planning and shop scheduling problem. There is a set of n jobs, a set of m machines, and each job is associated with a set of operations. Each job can be processed only at one machine at a time, and each machine can process only one job at a time. Unlike the job-shop problem, the order in which the job operations happen can vary freely (not predefined). The transmission time of job on different machines is considered in the model, and the following constraint requirements are expressed in OPL language.
1. The operations on the same machine cannot overlap.
forall(i in m)
noOverlap(Q[i]);
2. The operations of the same job cannot overlap.
forall(j in n)
noOverlap(Q[j]);
3. The transmission time of the same job on different machines is considered. Here the transmission time is machine-dependent, and the transmission time from machine
i1 to machine
i2 is given
TT[i1,i2].
How can I model the transmission time between adjacent operations
<Vu,Vu'> of job
j ?
endOf(Vu) + TT(typeofPrev(Vu'), typeofNext(Vu)) <= startOf(Vu')
------------------------------
chen zhen
------------------------------
#DecisionOptimization