What is it about?
Scheduling is an NP problem and using heuristics algorithms can effectively generate a near optimal solution to this kind of problems.
Featured Image
Read the Original
This page is a summary of: A multi-start path-relinking algorithm for the flexible job-shop scheduling problem, May 2015, Institute of Electrical & Electronics Engineers (IEEE),
DOI: 10.1109/ikt.2015.7288747.
You can read the full text:
Contributors
The following have contributed to this page
