Cedimoğlu, İsmail Hakkı
(SPRINGER, 2004)
This paper presents a tabu search approach for the job-shop scheduling problem. Although the problem is NP-hard, satisfactory solutions have been obtained recently by tabu search. However, tabu search has a problem-specific ...