Restricted neighborhood in the tabu search for the flowshop problem

Restricted neighborhood in the tabu search for the flowshop problem

0.00 Avg rating—0 Votes
Article ID: iaor1996919
Country: Netherlands
Volume: 62
Issue: 1
Start Page Number: 27
End Page Number: 37
Publication Date: Oct 1992
Journal: European Journal of Operational Research
Authors:
Keywords: scheduling
Abstract:

This paper deals with the minimizing weighted tardiness of jobs in a scheduling problem where the structure is that of the proportionate flowshop. A modified version of the Widmer-Hertz algorithm for the makespan problem is presented, improving the computational performance by reducing the size of the neighborhoods. The heuristic tests were applied to 720 flowshop problems, from 10 to 50 jobs.

Reviews

Required fields are marked *. Your email address will not be published.