Job Shop Schedule Problem
AnsweredHi all,
I'm considering a job shop shceduling problem, as shown in the following figure. In this example, there are three printed paper products that must pass through color printing presses in a particular order. The given data consists of a flowsheet showing the order in which each job passes through the color presses. But I don't know how to add the no overlap constraint, e.g, bule printer can't process two tasks at the same time. Could you please give me some advice?
Thanks a lot for your help.
-
Official comment
This post is more than two years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum, or try Gurobot, our chatbot interface offering instant, expert-level support. -
Hi Jun Zhou,
This problem is called Job Shop Scheduling. Check out the following paper for several ways this can be modeled:
- Riley
0 -
Hi Riley,
Thanks for your suggestions. I'll check the paper.
0 -
Hi Riley,
Thanks for your help. I have solved the Job-Shop Scheduling Problem. May I know whether Gurobipy can solve Flexible Job-Shop Scheduling problem? The idea is nearly the same. I think it shoule be able do this.
0 -
Hi Jun Zhou,
Technically speaking no, Gurobi doesn't solve the Flexible Job-Shop Scheduling problem, but it doesn't solve the Job-Shop Scheduling problem, or routing problems, or planning problems, or resource allocation problems etc, either. It solves LPs, MILP, QPs, QCPs, MIQCPs and so on. If a modeller can transform their problem, such as the Flexible Job-Shop Scheduling problem, into one of these problems that Gurobi can solve, then then it can make sense to use Gurobi.
There look to be some MILP formulations for the Flexible Job-Shop Scheduling problem in this paper:
- Riley
0 -
Thanks for your prompt response, Riley. I'll check the paper. I'll try to formulate the flexible job shop scheduling problem into MILP. Thanks again.
0 -
No problem, best of luck!
0
Post is closed for comments.
Comments
7 comments