Abstract
In this paper, a new heuristic method for solving the n-job m-machine job shop scheduling problem is presented. The objective is to minimize the makespan. This method is based on the Tabu Search technique, an iterative improvement approach to combinatorial optimization problems. Preliminary computational experiences with the proposed algorithm are very encouraging.
Original language | English |
---|---|
Pages | 115-119 |
Number of pages | 5 |
State | Published - 1996 |
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering