| We consider a class of problems of scheduling independent jobs on identical, uniform and unrelated parallel machines with an objective of achieving an optimal schedule. The primary focus is on the minimization of the maximum completion time of the jobs, commonly referred to as Makespan (Cmax). We survey and present examples of uniform machines and its applications to the single slot and multiple slots based on bids and budgets.;The Internet is an important advertising medium attracting large number of advertisers and users. When a user searches for a query, a search engine returns a set of results with the advertisements either on top of the page or on the right hand side. The assignment of these ads to positions is determined by an auction using the ad-slot placement. The algorithmic approach using the level algorithm (which constructs optimal preemptive schedules on uniform parallel machines) is taken into consideration for assigning bidders to the slots on the Internet. |
