Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 103-111 |
| Number of pages | 9 |
| Journal | European Journal of Operational Research |
| Volume | 80 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 5 1995 |
| Externally published | Yes |
Keywords
- Deterministic
- Parallel shop
- Scheduling
ASJC Scopus subject areas
- Computer Science(all)
- Modeling and Simulation
- Management Science and Operations Research
- Information Systems and Management