Block approach—tabu search algorithm for single machine total weighted tardiness problem (original) (raw)

A tabu search algorithm for the single machine total weighted tardiness problem

European Journal of Operational Research, 2007

In this study, a tabu search (TS) approach to the single machine total weighted tardiness problem (SMTWT) is presented. The problem consists of a set of independent jobs with distinct processing times, weights and due dates to be scheduled on a single machine to minimize total weighted tardiness. The theoretical foundation of single machine scheduling with due date related objectives reveal that the problem is NP-hard, rendering it a challenging area for meta-heuristic approaches. This paper presents a totally deterministic TS algorithm with a hybrid neighborhood and dynamic tenure structure, and investigates the strength of several candidate list strategies based on problem specific characteristics in increasing the efficiency of the search. The proposed TS approach yields very high quality results for a set of benchmark problems obtained from the literature.

A tabu search approach to machine scheduling

European Journal of Operational Research, 1998

In this paper we apply the tabu search (TS) technique to a complex machine scheduling problem. The problem can be considered as a generalization of the job-shop problem with both simple and parallel machines, job batches. setup times and release and due dates. The goal is to obtain feasible schedules by minimizing the makespan C

Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production

International Journal of Computers Communications & Control, 2007

The problem of efficiently scheduling production jobs on several machines is an important consideration when attempting to make effective use of a multimachines system such as a flexible job shop scheduling production system (FJSP). In most of its practical formulations, the FJSP is known to be NP-hard [8][9], so exact solution methods are unfeasible for most problem instances and heuristic approaches must therefore be employed to find good solutions with reasonable search time. In this paper, two closely related approaches to the resolution of the flexible job shop scheduling production system are described. These approaches combine the Ant system optimisation meta-heuristic (AS) with local search methods, including tabu search. The efficiency of the developed method is compared with others.

A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

Computers & Operations Research, 2011

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 re-optimization 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 tardiness

Ant systems & Local Search Optimization for flexible Job

The problem of efficiently scheduling production jobs on several machines is an important consideration when attempting to make effective use of a multimachines system such as a flexible job shop scheduling production system (FJSP). In most of its practical formulations, the FJSP is known to be NP-hard [8][9], so exact solution methods are unfeasible for most problem instances and heuristic approaches must therefore be employed to find good solutions with reasonable search time. In this paper, two closely related approaches to the resolution of the flexible job shop scheduling production system are described. These approaches combine the Ant system optimisation meta-heuristic (AS) with local search methods, including tabu search. The efficiency of the developed method is compared with others.

Tabu Search Algorithms for Cyclic Machine Scheduling Problems

2005

Tabu search algorithms are developed for solving a large class of cyclic machine scheduling problems with the objective to minimize the cycle time. Neighborhoods are derived which generalize the block-approach based neighborhoods which have been successfully applied to noncyclic job-shop problems. For a variant of this neighborhood opt-connectivity is proved.

A Tabu Search Algorithm to Minimize the Total Tardiness in the Parallel Machines Scheduling Problem

IFAC Proceedings Volumes, 2012

This article deals with the parallel machines scheduling problem to minimize the total tardiness, when jobs have different release dates. Preemption and splitting are not allowed. Since machines are considered identical, assigning a job to any of the available machines does not affect its processing time. This problem is considered NP-hard. This article presents a Tabu Search method to solve the problem, as well as a mathematical model. The proposed method is compared to a Local Search algorithm and other methods from literature, performing over 1000 different instances. The obtained results are discussed and analyzed to identify dominant structures of solutions.

A tabu search algorithm for parallel machine total tardiness problem

Computers & Operations Research, 2004

In this study, a Tabu Search (TS) approach to the parallel machine scheduling problem is presented. The problem considered consists of a set of independent jobs to be scheduled on a number of parallel processors to minimize total tardiness. Several surveys on parallel machine scheduling with due date related objectives [ 1, 2, 3] reveal that the NP-hard nature of the problem renders it a challenging area for many researchers who studied various versions.

Applying tabu search to the job-shop scheduling problem

Annals of Operations Research, 1993

In this paper, we apply the tabu-search technique to the job-shop scheduling problem, a notoriously difficult problem in combinatorial optimization. We show that our implementation of this method dominates both a previous approach with tabu search and the other heuristics based on iterative improvements.

The strategies and parameters of tabu search for job-shop scheduling

Journal of Intelligent Manufacturing, 2004

This paper presents a tabu search approach for the job-shop scheduling problem. Although the problem is NP-hard, satisfactory solutions have been obtained recently by tabu search. However, tabu search has a problem-specific and parametric structure. Therefore, in the paper, we focussed on the tabu search strategies and parameters such as initial solution, neighborhood structure, tabu list, aspiration criterion, elite solutions list, intensification, diversification and the number of iteration. In order to compare some neighborhood strategies and tabu list length methods, a computational study is done on the benchmark problems.