Abstract
In this paper we present two algorithms for a machine allocation problem occurring in manufacturing systems. For the two algorithms presented we prove worst-case performance ratios of 2 and 3/2, respectively. The machine allocation problem we consider is a general convex resource allocation problem, which makes the algorithms applicable to a variety of resource allocation problems. Numerical results are presented for two real-life manufacturing systems.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 523-530 |
| Number of pages | 8 |
| Journal | Operations research |
| Volume | 42 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1994 |