A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20031403
Country: United Kingdom
Volume: 30
Issue: 2
Start Page Number: 309
End Page Number: 320
Publication Date: Feb 2003
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics
Abstract:

In this paper, a two-stage assembly scheduling problem is considered with the objective of minimizing the total weighted flowtime. A lower bounding procedure and a dominance criterion are developed and incorporated into a branch and bound procedure. A heuristic procedure is also used to derive an initial upper bound. Computational results of the algorithm are presented.

Reviews

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