Our continual desire for perfection in problem solving results in the need for finding a best solution.Such a process involves searching.In this work we describe what the search process involves and its amenability to scheduling problems,in particular to the job-shop problem.Due to the difficult nature of this problem we create a framework that is able to improve current procedures by providing a better exploration of the search space.
展开▼
