Title of article
A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
Author/Authors
Ali Tozkapan، نويسنده , , ?mer K?rc، نويسنده , , Chia-Shin Chung، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2003
Pages
12
From page
309
To page
320
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.
Keywords
Two-stage assembly flowshop , Scheduling , Total weighted flowtime , Branch and bound algorithm
Journal title
Computers and Operations Research
Serial Year
2003
Journal title
Computers and Operations Research
Record number
927349
Link To Document