Dear Anand Jayakumar Arumugham,

Indeed, a wide range of scheduling software have been developed in recent years.

https://www.waterloo-software.com/job-shop-scheduling-software/

https://en.wikipedia.org/wiki/List_of_job_scheduler_software

https://sourceforge.net/directory/os:windows/?q=job%20shop%20scheduling

cdn.intechopen.com/pdfs/11619.pdf

http://www.aco-metaheuristic.org/aco-code/public-software.html

https://github.com/oahziur/animated-archer

thank you

You can try lekin, a very simple but flexible tool

http://web-static.stern.nyu.edu/om/software/lekin/

I have a decision science software called POM

MS Project

IBM CP Optimizer (http://www-01.ibm.com/software/commerce/optimization/cplex-cp-optimizer/index.html)

This tool aims at solving industrial scheduling problems involving much more complex constraints that in the job-shop scheduling problem but if we focus on classical job-shop scheduling:

1) The model of the problem is quite easy. Here is the model itself (using the Optimization Programming Language):

dvar interval op[j in Jobs][p in Pos] size Ops[j][p].pt; // Variable op[j][p] is the pth operation of job j

dvar sequence mchs[m in Mchs] in all(j in Jobs, p in Pos : Ops[j][p].mch == m) op[j][p]; // Operations on machine m

minimize max(j in Jobs) endOf(op[j][nbPos-1]);

subject to {

forall (m in Mchs)

noOverlap(mchs[m]);

forall (j in Jobs, p in 1..nbPos-1)

endBeforeStart(op[j][p-1], op[j][p]);

}

2) The automatic resolution:

2a) is an exact algorithm (it will find the optimal solution and prove its optimality if you let it run long enough)

2b) quickly comes up with very good quality solutions

2c) can scale to large problems involving several thousands of operations

As an example, 15 classical job-shop scheduling instances were closed using CP Optimizer in 2015 [1]

3) The tool is part of IBM ILOG CPLEX Optimization Studio (http://www-03.ibm.com/software/products/en/ibmilogcpleoptistud) and it is free of charge for academics in the context of IBM's Academic Initiative (https://developer.ibm.com/academic/)

[1] P. Vilím, P. Laborie and P. Shaw. "Failure-Directed Search for Constraint-Based Scheduling". Proceedings CP-AI-OR 2015.

Does anyone knows if these sof consider set up time depend sequence (sds)?

IBM CP Optimizer can easily handle sequence-dependent setup times on unary resources. There is the concept of a 'transition distance' matrix between activity types. For instance in the model above if SetupMatrix[m] is a setup time matrix of machine m you would just replace the noOverlap constraint noOverlap(mchs[m]) by noOverlap(mchs[m],SetupMatrix[m]).

Thank you for your quick response, I'm guessing it also works for flow shops, doesn't it?

Yes sure. And also for many other classical extensions in scheduling including:

- resource allocation (like flexible jobshop/flowshop)

- resource calendars (e.g. machines suspended during some break periods)

- cumulative resources (like in RCPSP or resources that can be produced/consumed)

- optional activities/operations

- minimal/maximal delays between operations (and in fact any type of temporal constraints)

- etc.

I really appreciate your help. thank you again. if by chance you know of a manual or video on how to used the software (if is posible directly for this scenario)

I forgot to mention that if you are interested to know more about CP Optimizer, here is a recent overview published in the Constraint journal:

http://ibm.biz/Constraints2018

I think Lekin software may be adequate for your need

http://community.stern.nyu.edu/om/software/lekin/

Lekin may be adecuate, it has its limitations (the developers also have an industrial version that you could ask). Cplex its the best. You could try also GAMS.

But i think that what you are looking for is this:

https://developers.google.com/optimization/scheduling/job_shop

Hope it helps!

CP Optimizer, ProPlanner, Ax

Check Matlab Central, I have posted few!