We present two lower bounds for the identical parallel processor weighted flow time problem and identify theoretical properties regarding relationships among these and other bounds for the problem. The new bounds, along with other bounds from the literature, are evaluated in a computational study and are found to be among the top three in performance. Conditions favorable to each of the top three performing bounds are identified.
- Parallel shop
ASJC Scopus subject areas
- Computer Science(all)
- Modeling and Simulation
- Management Science and Operations Research
- Information Systems and Management