A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times [An article from Free

Author: A. Allahverdi
Edition:
Binding: Digital
ISBN: B000RR654G

A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times [An article from: European Journal of Operational Research]

This digital document is a journal article from European Journal of Operational Research, published by Elsevier in . Get A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times [An article from computer books for free.
The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
In this paper, we address the three-machine flowshop scheduling problem. Setup times are considered separate from processing times, and the objective is to minimize total completion time. We show that the three-site distributed database scheduling problem can be modeled as a three-machine flowshop scheduling problem. A lower bound is developed and a dominance relation is established. Moreover, an upper bound is developed by using a three-phase Check A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times [An article from our best computer books for 2013. All books are available in pdf format and downloadable from rapidshare, 4shared, and mediafire.