Algorithms with performance guarantees for flow shops with regular objective functions |
| |
Authors: | Christos Koulamas George J. Kyparisis |
| |
Affiliation: | a Department of Decision Sciences and Information Systems, College of Business Administration, Florida International University, Miami, FL, USA |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 InformaWorld 等数据库收录! |
|