- Citations (7)
- Cited In (0)

- [Show abstract] [Hide abstract]

**ABSTRACT:**A polynomial-time algorithm is suggested for non-preemptive scheduling of n-independent jobs on m-unrelated machines to minimize the makespan. The algorithm has a worst-case performance ratio of 2−1/m. This is better than the earlier known best performance bound 2. Our approach gives the best possible approximation ratio that can be achieved using the rounding approach.Operations Research Letters 01/2005; 33:127-133. · 0.52 Impact Factor - [Show abstract] [Hide abstract]

**ABSTRACT:**We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines.Oper. Res. Lett. 01/2010; 38:47-50. - [Show abstract] [Hide abstract]

**ABSTRACT:**We consider the graph balancing problem of providing orientations to edges in an undirected multi-graph to minimize the maximum load. We first obtain an FPTAS when the multi-graph is restricted to a tree. We also obtain some additional results for other restricted cases by showing equivalencies with related combinatorial problems.Information Processing Letters 01/2009; 110:24-29. · 0.49 Impact Factor

Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.