Originally posted by: YYHH

Hi 

I want to model a condition similar to jobshop scheduling problem use integer programming: product X going through step A, B, C in sequence; product Y going through step A, B in sequence; product Z going through step C, D in sequence. Step A uses one resource A (multiple resource A available), Step B uses one resource B (multiple resource B available), and Step C uses one resource C (multiple available), Step D uses one resource D (multiple available). There are x number of product X, y number of product Y, and z number of product Z. 

Can anyone give me some hint in terms of how to design input data structure to represent that each product need to go through multiple steps (and the number of steps for different product is different), and how to model the precedence relationship in OPL?

Thank you.

Hi,

you may start from the example in opl\examples\opl\sched_flowshop for how to model the machines and then sched_calendar.mod for precedences and sched_cumul.mod on how to use cumul

regards

Originally posted by: YYHH

Hi Alex

Thank you for your advice. The problem is that I want to use mixed integer programming instead of constraint programming, but I cannot find similar examples.

Hi,

why don't you want to use CPO for that ?

Very easy, you simply add

using CP;

at the beginning of the model.

At https://www.ibm.com/developerworks/community/wikis/home?lang=en#!/wiki/W1a790e980a7d_49c5_963d_2965e5d01401/page/Virtual%20User%20Group%20Meetings

I think you should watch

Modeling and Solving Scheduling Problems with CP Optimizer

Last year an overview on CP Optimizer was provided by Paul Shaw at this Virtual Users Group forum. In the upcoming session, we will follow-up on the original topic and focus on using CP Optimizer to address scheduling problems. We will initially cover modeling concepts related with scheduling in CP Optimizer. Using examples we will then provide details on tools, functionalities and tips for speeding-up the development of your scheduling models and improving their efficiency.

regards