Cloud computing is the latest technology that involves distributed computation over the Internet. It meets the needs of users through sharing resources and using virtual technology. The workflow user applications refer to a set of tasks to be processed within the cloud environment. Scheduling algorithms have a lot to do with the efficiency of cloud computing environments through selection of su...

A new online task assignment scheme is presented for multiprocessor sysiems where individual processors ezecute the rate-monotonic scheduling algorithm. The computational complezity of the task assignment scheme grows linearly with the number of iasks, and its performance i s shown t o be significantly better than previously ezisiing schemes. The superiority of the assignment scheme is achieved...

The main objective of the working paper series of the IIMA is to help faculty members to test out their research findings at the pre-publication stage. Abstract We address the permutation flowshop scheduling problem with earliness and tardiness penalties (E/T) and common due date of jobs. Large number of process and discrete parts industries follow flowshop type of production process. There are...

In this paper we consider the single machine scheduling problem with integer release dates and the objective of minimising the sum of deviations of jobs’ completion times from a common integer due date. We present an efficient polynomial algorithm for the unit processing time case. We also show how to calculate in polynomial time the minimum non-restrictive due date for the general case.

We consider a stochastic scheduling problem with impatience to the end of service or impatience to the beginning of service. The impatience of a job can be seen as a stochastic due date. Processing times and due dates are random variables. Jobs are processed on a single machine with the objective to minimize the expected weighted number of tardy jobs in the class of static list scheduling polic...

In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a d...

Uncertainty is an inevitable element in many practical production planning and scheduling environments. When a due date is predetermined for performing a set of jobs for a customer, production managers are often concerned with establishing a schedule with the highest possible confidence of meeting the due date. In this paper, we study the problem of scheduling a given number of jobs on a specif...

We study the problem of scheduling jobs with release times and due-dates on a single machine with the objective to minimize the maximal job lateness. This problem is strongly NP-hard, however it is known to be polynomially solvable for the case when the processing times of some jobs are restricted to either p or 2p, for some integer p. We present a polynomial-time algorithm when job processing ...