Using heuristic algorithms, I'm studying solution methods for various flow-shop scheduling problems. Each method generates an optimal job sequence. With this job sequence, we get the total elapsed time or makespan. However, for an n-jobs and m-machine flow-shop scheduling problem, manually determining the makespan and creating the Gantt chart is quite tedious.
Could you suggest any software or tools to generate the Gantt chart and to determine the makespan (total elapsed time) of an optimal job sequence for a flow-shop scheduling problem?
Looking forward to your precious suggestions. Thank you!
Not an expert on the matter. Perhaps an assessment of declarative programming languages, with added capability for constraint programming, might be useful.
Tedious it is. yes. Use plotly:
https://plotly.com/python/gantt/
A problem you eventually will run into is to gather the abundance of tasks under each processor, and eventually minimize the requirements for number of processors. There is a solution to that (wip) on:
https://nbviewer.org/github/root-11/graph-theory/blob/master/examples/solving%20search%20problems.ipynb
under the headline "Critical path method" (about halfway down).
- Badges
- Science topic