We consider the problem of scheduling a set of jobs on a single machine with the objective of minimizing sum of weighted completion times. The problem is NP-hard when there are precedence constraints between jobs 15]. We provide an eecient com-binatorial 2-approximation algorithm for this problem. In contrast to our work, earlier approximation algorithms 12] achieving constant factor approximat...

in some industries as foundries, it is not technically feasible to interrupt a processor between jobs. this restriction gives rise to a scheduling problem called no-idle scheduling. this paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. the problem is first mathematically formulated by three different mixed integer linear programming...

We use a block iterative method for solving linear least squares problems. The subproblems are solved asynchronously on a distributed memory multiprocessor. It is observed that increased number of processors results in deteriorating convergence. We illustrate the deteriorating convergence by some numerical experiments. The deterioration of the convergence can be explained by contamination of th...

We study a temperature-aware scheduling problem aiming in maximizing the throughput of a set of unit-length jobs, each one having its own heat contribution, on a single processor operating under a strict temperature threshold. Following a simplified model for the processor’s thermal behavior, proposed by Chrobak et al. [9], we analyze the approximation factor of the natural CoolestFirst schedul...

 This study presents an inventory model for deteriorating items with linearly time-dependent demand rate under trade credits. Mathematical models have been derived under four different situations i.e. Case 1 : The cycle time T is greater than or equal to M1, to get a cash discount, Case 2 : The cycle time T is less than M1, Case 3 : The cycle time is greater than or equal to M2, and Case 4 : T...