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...

We consider preemptive machine scheduling problems on identical parallel machines. It is shown that every such problem with chain-like precedence constraints, release dates and a regular unit-concave objective function has the following integer preemption property : for any problem instance with integral input data there exists an optimal schedule where all interruptions (as well as starting an...

this paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. the objective is to minimize the weighted sum of makespan and maximum tardiness. three meta-heuristic methods based on genetic algorithm (ga), imperialist competitive algorithm (ica) and a hybrid approach of ga a...

Meeting due dates as a re ̄ ection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today’s manufacturing environments. The natural quanti ® cation of this qualitative goal involves tardiness related measures. In this study, we consider the dynamic job shop scheduling problem with the weighted tardiness criterion. After we present a comprehensive liter...

In this researcha particle swarm optimization (PSO) algorithm is proposedfor no-wait flowshopsequence dependent setuptime scheduling problem with weighted earliness-tardiness penalties as the criterion ( | , | ∑ " ).The smallestposition value (SPV) rule is applied to convert the continuous value of position vector of particles in PSO to job permutations.A timing algorithm is generated to find t...

Given the anticipated benefits of better solutions, the scheduling problem of minimizing the total tardiness for single machine with sequence dependent setup times continues to represent a challenge for researchers to resolve. This research presents a novel Max-Min Ant System (MMAS) algorithm for solving this problem. The MMAS algorithm adopts a new local search technique where, a position is r...

A new meta-heuristic for scheduling multiple jobs on a single machine so that they are completed by a common specified date (neither earlier, nor later) is addressed in this paper. Costs are set depending on whether a job finished before (earliness), or after (tardiness) the specified due date. The objective is to minimize the total weighted earliness and tardiness penalized costs from the spec...