Simultaneous Approximation Ratios for Parallel Machine Scheduling Problems
- 5 Downloads
Motivated by the problem to approximate all feasible schedules by one schedule in a given scheduling environment, we introduce in this paper the concepts of strong simultaneous approximation ratio and weak simultaneous approximation ratio. Then we study the two variants under various scheduling environments, such as non-preemptive, preemptive or fractional scheduling on identical, related or unrelated machines.
KeywordsScheduling Simultaneous approximation ratio Global fairness
Mathematics Subject Classification90B35 90C27
The authors would like to thank the associate editor and two anonymous referees for their constructive comments and helpful suggestions.
- 6.Bhargava, R., Goel, A., Meyerson, A.: Using approximate majorization to characterize protocol fairness. In: Proceedings of the 2001 ACM Special Interest Group for the computer systems performance evaluation community. International Conference on Measurement and Modeling of Computer Systems, pp. 330–331. ACM, New York (2001)Google Scholar