The problem of determining a schedule of jobs with unit time lengths on a single machine that minimizes the total weighted earliness and tardiness penalties with respect to arbitrary rational due dates is formulated as an integer programming problem We show that if the penalties meet a certain criterion called the Dominance Condition then there exists an extremal optimal solution to the LP rela...

Mixed model two-sided assembly lines (MM2SAL) are applied to assemble large product models, which is produced in high-volume. So, the sequence planning of products to reduce cost and increase productivity in this kind of lines is imperative. The presented problem is tackled in two steps. In step 1, a framework is developed to select and prioritize customer orders under the finite capacity of th...

This paper considers an integrated routing and scheduling problem where the part takes into account costs tardiness penalties is modelled by a permutation flow shop with inventory costs. We assume that each batch served dedicated vehicle, number of batches their compositions (the jobs parameters those jobs) are known in advance. The to determine starting times on machine shop, departure dates d...

We present a simple result in single-machine scheduling theory. Namely, the number of tardy jobs in a sequence which is optimal with respect to total tardiness is no greater than the number of tardy jobs in the earliest due date sequence. This provides a bound for solutions to the total tardiness problem on a single machine found using branch and bound, dynamic programming or the decomposition ...

We address a complex scheduling problem arising in the wood panel industry with the objective of minimizing a quadratic function of job tardiness. The proposed solution strategy, which is based on an effective genetic algorithm, has been coded and implemented within a major Tunisian company, leader in the wood panel manufacturing. Preliminary experimental results indicate significant decrease o...

In the injection moulding process, a set-up containing positioning moulds, cleaning raw material hopper and machine settings is required. The uncertain owing to random factors, such as crew’s skill levels unexpected breakdowns. general version of this problem known single-machine scheduling with stochastic sequence-dependent times. specialized form problem, objective function defined so minimiz...

In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck tabu search (SB-TS) algorithm by replacing the reoptimization step in the shifting bottleneck (SB) algorithm by a tabu search (TS). In terms of the shifting bottleneck heuristic, the proposed tabu search optimizes the total weighted tardi...

Task scheduling is an essential aspect of parallel processing system. This problem assumes fully connected processors and ignores contention on the communication links. However, as arbitrary processor network (APN), communication contention has a strong influence on the execution time of a parallel application. In this paper, we propose multi-objective genetic algorithm to solve task scheduling...

In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this...

In the game industry, tardiness is an important issue. Unlike a unifunctional machine, developer may excel in programming but be mediocre scene modeling. His/her processing speed varies with job type. To minimize tardiness, we need to schedule these developers carefully. Clearly, traditional scheduling algorithms for machines are not suitable such versatile developers. On other hand, unrelated ...