An automatic tuning method for multi phased probability of rule application in tabu search for a job shop problem


The target of this research is a job shop problem with group constraints where jobs are grouped and processed together. This problem is evaluated using the average manufacturing time needed for the completion of all jobs, the number of group changes, and the number of line rests. It is a large-scale combinatorial problem where about 2000 jobs are processed… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics