This paper proposes a novel algorithm for a real-world job shop-scheduling problem, where both lot-sizing and batching processes are considered. A fuzzy rule-based system is developed for determining lot sizes, where the input variables are workload on the shop floor, size of the job and its urgency while the output is the size of the lots. Both input and output variables are modelled as lingui...

Abstract We consider a scheduling problem where set of known jobs needs to be assigned given parallel resources such that the expected waiting time for uncertain emergency is kept as small possible. On basis structural insights from queuing theory, we develop deterministic policies reserve resource capacity in order increase likelihood availability whenever an job arrives. Applications this par...

For many years real-time task models have focused the timing constraints on execution windows de ned by earliest start times and deadlines for feasibility. However, the utility of some application may vary among scenarios which yield correct behavior, and maximizing this utility improves the resource utilization. For example, target sensitive applications have a target point where execution res...

| The workload of many real-time systems can be characterized as a set of preemptable jobs with linear precedence constraints. Typically their execution times are only known to lie within a range of values. In addition jobs share resources and access to the resources must be synchronized to ensure the integrity of the system. This paper is concerned with the schedulability of such jobs when sch...

In this work the authors addresses the problem of sequencing a set of jobs on a single machine using a genetic algorithm and simulation. The goal is to find the schedule that minimizes the total earliness and tardiness penalties of all jobs, under the assumptions that no pre-emption of jobs is allowed and all jobs are available at time zero. In order to accelerate the search process, the Author...

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

In this work, we investigate the potential utility of parallelization for meeting real-time constraints and minimizing energy. We consider malleable Gang scheduling of implicitdeadline sporadic tasks upon multiprocessors. We first show the non-necessity of dynamic voltage/frequency regarding optimality of our scheduling problem. We adapt the canonical schedule for DVFS multiprocessor platforms ...