Total weighted tardiness is a measure of customer satisfaction. Minimizing it represents satisfying the general requirement of on-time delivery. In this research, we consider an ant colony optimization (ACO) algorithm to solve the problem of scheduling unrelated parallel machines to minimize total weighted tardiness. The problem is NP-hard in the strong sense. Computational results show that th...

This paper surveys the literature related to solving traditional unrelated parallel-machine scheduling problems. It compiles algorithms for the makespan, total weighted sum of completion times, maximum tardiness, total tardiness, total earliness and tardiness, and multiple criteria performance measures. The review of the existing algorithms is restricted to the deterministic problems without se...

The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...

We study the parallel machine scheduling problem with release dates and we consider several “min-sum” objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to compare these lower bounds according to th...

this paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. this paper presen...

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

This paper presents the fuzzy mixed-integer goal programming model for a single machine scheduling problem with bi-objectives consisting of the minimization of the total weighted flow time and total weighted tardiness. This model is solved by a fuzzy goal programming approach to verify and validate the proposed approach for the above problem. Two test problems in small and large sizes are gener...

In this paper we consider two routing problems: traveling salesman problem (TSP, fundamental problem of the combinatorial optimization) and the TSP with times of traveling, times of processing and due dates where the objective is to minimize the total weighted tardiness (TSPTWT). Since problems are NP-hard in the strong sense, we propose a metaheuristic algorithm to determine a good suboptimal ...

In this paper we study the resource-constrained project scheduling problem with weighted earliness-tardiness penalty costs. Project activities are assumed to have a known deterministic due date, a unit earliness as well as a unit tardiness penalty cost and constant renewable resource requirements. The objective is to schedule the activities in order to minimize the total weighted earliness-tard...