A branch and bound algorithm for two-stage hybrid flow shop scheduling: minimizing the number of tardy jobs

A branch and bound algorithm for two-stage hybrid flow shop scheduling: minimizing the number of tardy jobs

0.00 Avg rating0 Votes
Article ID: iaor20081721
Country: South Korea
Volume: 33
Issue: 2
Start Page Number: 213
End Page Number: 220
Publication Date: Jun 2007
Journal: Journal of the Korean Institute of Industrial Engineers
Authors: ,
Keywords: programming: branch and bound
Abstract:

This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in series, each of which has multiple identical parallel machines. The problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also suggested to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

Reviews

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