A tabu search algorithm for parallel machine total tardiness problem
type: Item
instance of: scholarly article
title: A tabu search algorithm for parallel machine total tardiness problem
zbMATH Open document ID: 1057.90516
DOI: 10.1016/S0305-0548(02)00198-3
author: Ümit Bilge
author: Furkan Kıraç
author: Müjde Kurtulan
author: Pelin Pekgün
published in: Computers \& Operations Research
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 2137515
zbMATH Keywords: Scheduling
zbMATH Keywords: Parallel machines
zbMATH Keywords: Total tardiness problem
zbMATH Keywords: Sequence dependent setup times
zbMATH Keywords: Tabu search
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Survey of scheduling research involving due date determination decisions
cites work: The Total Tardiness Problem: Review and Extensions
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Scheduling with Deadlines and Loss Functions on k Parallel Machines
cites work: Q4124332
cites work: Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
cites work: Heuristics for minimizing mean tardiness form parallel machines
cites work: Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
cites work: Q4354785
cites work: Q4495496
cites work: Performance enhancements to tabu search for the early/tardy scheduling problem
cites work: Applying tabu search with influential diversification to multiprocessor scheduling
cites work: The flow shop with parallel machines: A tabu search approach
cites work: A tabu search algorithm for the open shop scheduling problem
cites work: Parallel machine scheduling with earliness and tardiness penalties
cites work: Early/tardy scheduling with sequence dependent setups on uniform parallel machines
cites work: A tabu search algorithm for the optimisation of telecommunication networks
full work available at URL: s0305-0548(02)00198-3
OpenAlex ID: W2063143176
description: scientific article; zbMATH DE number 2137515