The earliest-pseudo-deadline-first (EPDF) Pfair algorithm is more efficient than other known Pfair schedulingalgorithms, but is not optimal for scheduling recurrent real-time task systems on more than two identical pro-cessors. Although not optimal, EPDF may be preferable for real-time systems instantiated on less-powerfulplatforms, those with soft timing constraints, or those whose...

A great amount of energy is wasted in industry by machines that remain idle due to underutilization. A way to avoid wasting energy and thus reducing the carbon print of an industrial plant is to consider minimization of energy consumption objective while making scheduling decisions. In order to minimize energy consumption, the decision maker has to decide the timing and length of turn off /turn...

Mixed model assembly lines (MMAL) are a type of production line where a variety of product models similar in product characteristics are assembled. The effective design of these lines requires that schedule for assembling the different products is determined. In this paper we tried to fit the sequencing problem with the main characteristics of make to order (MTO) environment. The problem solved...

This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...

In this note, we correct a mistake which was made in the paper “Minimizing Total Tardiness on Parallel Machines with Preemptions’ (see Journal of Scheduling, Vol. 15, 2012, 193 200).

This is the review of two papers, Tardiness Bounds under Global EDF Scheduling on a Multiprocessor (RTSS’05) and An O(m) Analysis Technique for Supporting Real-Time Self-Suspending Task Systems (RTSS’12).

For five single machine total tardiness problems a fully polynomial-time approximation scheme (FPTAS) based on a graphical algorithm is presented. The FPTAS has the best running time among the known approximation schemes for these problems.

In a production environment, scheduling decides job and machine allocations the operation sequence. shop system, wide variety of jobs, complex routes, real-life events becomes challenging for activities. New, unexpected disrupt schedule require dynamic updates to on an event-based basis. To solve problem, we propose multi-agent system with reinforcement learning aimed at minimization tardiness ...

In this paper we consider single machine scheduling problems with a common due-date for all jobs, arbitrary monotone earliness and tardiness costs and arbitrary breakdown and repair processes. We show that the problem is equivalent to a deterministic one without breakdowns and repairs and with an equivalent cost function of a job's completion time. A V-shaped schedule without idle times is show...