Algorithms with performance guarantees for flow shops with regular objective functions.: An article from: IIE Transactions
Description
This digital document is an article from IIE Transactions, published by Thomson Gale on December 1, 2005. The length of the article is 5631 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.
From the author: We consider flow-shop scheduling problems with regular (nondecreasing) objective functions such as the minimization of makespan in the presence of arbitrary precedence constraints, the weighted sum of job completion times in the presence of series-parallel precedence constraints, the discounted total weighted completion time, and the sum of the quadratic job completion times. We present algorithms with tight worst-case performance bounds for all of these problems by utilizing the optimal permutations for the corresponding single-machine problems. We also investigate the asymptotic optimality of our algorithms.
Citation Details
Title: Algorithms with performance guarantees for flow shops with regular objective functions.
Author: Christos Koulamas
Publication:IIE Transactions (Magazine/Journal)
Date: December 1, 2005
Publisher: Thomson Gale
Volume: 37 Issue: 12 Page: 1107(5)
Distributed by Thomson Gale
From the author: We consider flow-shop scheduling problems with regular (nondecreasing) objective functions such as the minimization of makespan in the presence of arbitrary precedence constraints, the weighted sum of job completion times in the presence of series-parallel precedence constraints, the discounted total weighted completion time, and the sum of the quadratic job completion times. We present algorithms with tight worst-case performance bounds for all of these problems by utilizing the optimal permutations for the corresponding single-machine problems. We also investigate the asymptotic optimality of our algorithms.
Citation Details
Title: Algorithms with performance guarantees for flow shops with regular objective functions.
Author: Christos Koulamas
Publication:IIE Transactions (Magazine/Journal)
Date: December 1, 2005
Publisher: Thomson Gale
Volume: 37 Issue: 12 Page: 1107(5)
Distributed by Thomson Gale
