On the minimization of total weighted flow time with identical and uniform parallel machines

Date

1999-02-16

Author

Azizoğlu, Meral
Kirca, O

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

We consider the NP-hard problem of scheduling jobs on identical parallel machines to minimize total weighted flow time. We discuss the properties that characterize the structure of an optimal solution, present a lower bound and propose a branch and bound algorithm. The algorithm is superior to prior methods presented in the literature. We also extend the algorithm to uniform parallel machines and solve medium-sized problem instances. (C) 1999 Elsevier Science B.V. All rights reserved.

Subject Keywords

Branch and bound, Parallel machines, Scheduling

URI

https://hdl.handle.net/11511/41915

Collections

Department of Industrial Engineering, Article