A tabu search algorithm for parallel machine total tardiness problem

Authors:
Ümit Bilge;Furkan Kiraç;Müjde Kurtulan;Pelin Pekgün
Affiliations:
Department of Industrial Engineering, Bogaziçi University, Bebek, 80815 Istanbul, Turkey;Department of Industrial Engineering, Bogaziçi University, Bebek, 80815 Istanbul, Turkey;Department of Industrial Engineering, Bogaziçi University, Bebek, 80815 Istanbul, Turkey;Department of Industrial Engineering, Bogaziçi University, Bebek, 80815 Istanbul, Turkey
Venue:
Computers and Operations Research
Year:
2004

Citing 9
Cited 18

Sequencing with earliness and tardiness penalties: a review

Operations Research
Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
Applying tabu search with influential diversification to multiprocessor scheduling

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness

Computers and Industrial Engineering
A tabu search algorithm for the open shop scheduling problem

Computers and Operations Research
Early/tardy scheduling with sequence dependent setups on uniform parallel machines

Computers and Operations Research
Parallel machine scheduling with earliness and tardiness penalties

Computers and Operations Research
Tabu Search

Tabu Search

Parallel machine selection and job scheduling to minimize machine cost and job tardiness

Computers and Operations Research
Scheduling unrelated parallel machines with sequence-dependent setups

Computers and Operations Research
Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach

Computers and Operations Research
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm

Expert Systems with Applications: An International Journal
An ant colony optimization for single-machine weighted tardiness scheduling with sequence-dependent setups

SMO'06 Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization
A population-based variable neighborhood search for the single machine total weighted tardiness problem

Computers and Operations Research
An evolutionary simulation-optimization approach in solving parallel-machine scheduling problems - A case study

Computers and Industrial Engineering
Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints

Computers and Operations Research
A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates

Computers and Operations Research
Scheduling algorithms for a semiconductor probing facility

Computers and Operations Research
Integrating parts design characteristics and scheduling on parallel machines

Expert Systems with Applications: An International Journal
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem

Computers and Operations Research
An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem

Computers and Industrial Engineering
Tabu search heuristics for parallel machine scheduling with sequence-dependent setup and ready times

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Scheduling jobs in flowshops with the introduction of additional machines in the future

Expert Systems with Applications: An International Journal
Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates

International Journal of Applied Evolutionary Computation
Learning reusable initial solutions for multi-objective order acceptance and scheduling problems with genetic programming

EuroGP'13 Proceedings of the 16th European conference on Genetic Programming
Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.02

Visualization

Abstract

In this study, we consider the problem of scheduling a set of independent jobs with sequence dependent setups on a set of uniform parallel machines such that total tardiness is minimized. Jobs have nonidentical due dates and arrival times. A tabu search (TS) approach is employed to attack this complex problem. In order to obtain a robust search mechanism, several key components of TS such as candidate list strategies, tabu classifications, tabu tenure and intensification/diversification strategies are investigated. Alternative approaches to each of these issues are developed and extensively tested on a set of problems obtained from the literature. The results obtained are considerably better than those reported previously and constitute the best solutions known for the benchmark problems as to date.