Authors: Azizoglu M.¹; Webster S.²

Source: International Journal of Production Research, Volume 41, Number 6, 2003 , pp. 1199-1215(17)

Publisher: Taylor and Francis Ltd

Abstract:

We describe and evaluate several branch-and-bound algorithms for an identical parallel machine scheduling problem with family set-up times and an objective of minimizing total weighted flowtime. The algorithms differ by choice of lower bound method. Computational results suggest conditions favourable to a particular algorithm as well as the range of problem sizes that can be optimally solved in reasonable CPU time.

Document Type: Research article

Affiliations: 1: Middle East Technical University, Department of Industrial Engineering, Ankara 06531, Turkey 2: Syracuse University, School of Management, Syracuse, New York 13244-2130, USA

Publication date: 2003-01-01

More about this publication?

• Editorial Board
• Information for Authors
• Subscribe to this Title
• ingentaconnect is not responsible for the content or availability of external websites

Related content

• In this: publication
• By this: publisher
• In this Subject: Materials & Manufacturing
• By this author: Azizoglu M. ;  Webster S.

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers