We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery performance, between maximizing machine utilization by batching similar jobs and maximizing customers’ satis...

Advances in micro technology has led to the development of miniaturized sensor nodes with wireless communication to perform several real-time computations. These systems are deployed wherever it is not possible to maintain a wired network infrastructure and to recharge/replace batteries and the goal is then to prolong as much as possible the lifetime of the system. In our work, we aim to modify...

This paper deals with the real time implementation of a web integrated scheduling support system for a multiproduct manufacturing industry. The industry manufactures a wide variety of products ranging from steam turbines, gas turbines to compressors. The product assembly is quite complex, in particular a typical bill of material (BOM) has more than 50 levels. It is obvious that scheduling of th...

This paper deals with single-machine scheduling problems with an actual time-dependent learning consideration. First, we provide a mathematical description of learning effects in scheduling environment. Then we introduce an actual time-dependent learning model, in which the learning effect is defined a function of the ratio of sum of actual processing times of the jobs previously scheduled to t...

It is well known that in the majority of cases the problem of preemptive task scheduling on m parallel identical processors with the objective of minimizing makespan can be solved in polynomial time. For example, for tree-like precedence constraints the algorithm of Muntz and Co€man can be applied. In this paper, this problem is generalized to cover the case of parallel processors which are ava...

We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search...

In this paper, We propose a faster algorithm for the following instruction scheduling problem: Given a set of UET (Unit Execution Time) instructions with precedence constraints in the form of a DAG(Directed Acyclic Graph), latency constraints where latencies between any two instructions are restricted to be either 0 or 1, timing constraints in the form of individual integer release times and de...

the problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. we seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. we assume that the work content required by the activities follows an exponential distribution. the decision variables of the model are the allocated resourc...

We present a Niched Pareto Genetic Algorithm (NPGA) approach to the scheduling of scientific workflows in a wireless grid environment that connects computational resources, wired grids and wireless device resources such as cameras, microphones, network interfaces and so forth where the maximization of job completion ratio and minimization of lateness is crucial. Our approach supports handling u...

In 1] a branch-and-bound implicit enumeration algorithm is described whose purpose is to generate a feasible schedule, if any, for each processor on a multiprocessing node running hard real-time processes. The optimization criterion is to minimize process lateness deened as the diierence between the process completion time and deadline. We show in this correspondence that this algorithm does no...