Flow-shop scheduling for three serial stations with the last two duplicate

Flow-shop scheduling for three serial stations with the last two duplicate

0.00 Avg rating0 Votes
Article ID: iaor20052128
Country: United Kingdom
Volume: 32
Issue: 3
Start Page Number: 647
End Page Number: 667
Publication Date: Mar 2005
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics, programming: branch and bound
Abstract:

This paper addresses the problem of scheduling jobs for three serial stations with the last two duplicate, i.e., identical. The performance measure considered is the makespan, and a Branch and Bound and two heuristic procedures are proposed. Two dominance criteria are developed to produce the optimal schedule for the jobs sequenced so far. Extensive computational experiments reveal that the Genetic Algorithm can be used to obtain a group of effective solutions for any realistic size problem within small computation time.

Reviews

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