Scheduling Unrelated Parallel Machines Computational Results
Scheduling n independent jobs on m unrelated parallel machines without preemption belongs to the most difficult scheduling problems. Here, processing job i on machine j takes time p ij , and the total time used by a machine is the sum of the processing times for the jobs assigned to it. The objective is to minimize makespan. In this paper we present an experimental study on the Unsplittable-Truemper algorithm. This purely combinatorial approach computes 2-approximate solutions in the best worst-case running time known so far. The goal of our simulations was to prove its efficiency in practice. We compare our technique with algorithms and heuristics used in practice, especially with those based on the two-step approach. The experiments show that for large and difficult instances the Unsplittable-Truemper algorithm has a clear advantage over methods based on linear programming. Moreover, it requires much less operational memory, and thus is more effective and easier to handle.
KeywordsSchedule Problem Bipartite Graph Column Generation Master Problem Linear Programming Relaxation
Unable to display preview. Download preview PDF.
- 1.Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)Google Scholar
- 4.Gairing, M., Lücking, T., Mavronicolas, M., Monien, B.: Computing nash equilibria for scheduling on restricted parallel links. In: Proceedings of the 36th Annual ACM Symposium on the Thoery of Computing (STOC 2004), pp. 613–622 (2004)Google Scholar
- 7.Graham, R.L.: Bounds for certain multiprocessor anomalies. Bell System Technical Journal 45, 1563–1581 (1966)Google Scholar
- 9.Kleinberg, J.: Single-source unsplittable flow. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS 1996), pp. 68–77 (1996)Google Scholar
- 17.Vaidya, P.M.: Speeding up linear programming using fast matrix multiplication. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), pp. 332–337 (1989)Google Scholar