Job-Shop Neighbourhoods And Move Evaluation Strategies (2007)
Anant Singh Jain, Balasubramanian Rangaswamy, Sheik Meeran
The time complexity of a search depends on (1) the size of the neighbourhood and (2) the complexity in determining the cost of the moves. Therefore in order for the search to be effective and...
Anant Singh Jain, Balasubramanian Rangaswamy, Sheik Meeran
Examination of the job-shop scheduling literature uncovers a striking trend. As methods for the deterministic job-shop problem have gradually improved over the years, they have come to rely on...
Tabu Search Candidate List Strategies in Scheduling (2007)
Balasubramanian Rangaswamy, Fred Glover
Candidate list strategies form an important cornerstone of Tabu Search (TS), yet are often neglected in TS research. In this paper, we review candidate list construction principles and illustrate...
Thesis (Ph. D.)--University of Colorado, 1998.
Thesis (Ph. D.)--University of Colorado, 1998.