Comparing scheduling rules for flexible flow lines

Comparing scheduling rules for flexible flow lines

0.00 Avg rating0 Votes
Article ID: iaor20041551
Country: Netherlands
Volume: 85
Issue: 3
Start Page Number: 371
End Page Number: 388
Publication Date: Jan 2003
Journal: International Journal of Production Economics
Authors: ,
Keywords: heuristics
Abstract:

This paper explores scheduling flexible flow lines with sequence-dependent setup times. Three major types of heuristics are explored. Insertion heuristics (based on insertion heuristics for the travelling salesman problem) attempt to simultaneously equalize workload on all processors at a stage, and minimize total or single-stage flowtimes. Johnson's algorithm for two-stage flow shops and its heuristic extensions to m-machine flow shops are modified for parallel processors and the flexible flow-line environment. A set of naive greedy heuristics is investigated for comparison purposes. The performance of the heuristics is compared on a set of test problems. Results indicate the range of conditions under which each method performs well.

Reviews

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