Parallel flowshop scheduling using Tabu search

Parallel flowshop scheduling using Tabu search

0.00 Avg rating0 Votes
Article ID: iaor2004170
Country: United Kingdom
Volume: 41
Issue: 13
Start Page Number: 3059
End Page Number: 3073
Publication Date: Jan 2003
Journal: International Journal of Production Research
Authors: ,
Keywords: tabu search, flowshop
Abstract:

Production scheduling problems in manufacturing systems with parallel machine flowshops are discussed. A mathematical programming model for combined part assignment and job scheduling is developed. The objective of solving the scheduling problem is to minimize a weighted sum of production cost and the cost incurred from late product delivery. The solution of the model is NP-hard. To solve the problem efficiently, a heuristic algorithm combining Tabu search and Johnson's method was proposed. Several numerical examples are presented to illustrate the developed model and the algorithm. Computational results from these example problems are very encouraging.

Reviews

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