We consider the distributed scheduling problem on parallel machines with central objective of maximizing number on-time jobs. Jobs are self-interested utility-maximizers that can choose they processed and exclusively interested in reducing their own private function. Each machine processes jobs according to a local policy. discuss Nash equilibria resulting schedules perform thorough analysis (a...

Natural disasters, such as earthquakes, tsunamis, and hurricanes cause enormous harm during each year. To reduce casualties and economic losses in the response phase, rescue units must be allocated and scheduled efficiently, such that it is a key issues in emergency response. In this paper, a multi-objective mix integer nonlinear programming model (MOMINLP) is proposed to minimize sum of weight...

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 (SAR) and weak simultaneous approximation ratio (WAR). Then we study the two parameters under various scheduling environments, such as, nonpreemptive, preemptive or fractional scheduling on identical,...