Performance enhancements to tabu search for the early/tardy scheduling problem
type: Item
instance of: scholarly article
title: Performance enhancements to tabu search for the early/tardy scheduling problem
zbMATH Open document ID: 0991.90056
DOI: 10.1016/S0377-2217(97)00261-0
published in: European Journal of Operational Research
publication date: 2002-08-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1782807
zbMATH Keywords: tabu search
zbMATH Keywords: early/tardy scheduling
zbMATH Keywords: heuristics
author: Ross J. W. James
author: John Buchanan
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Restricted neighborhood in the tabu search for the flowshop problem
cites work: An experimental comparison of solution algorithms for the single-machine tardiness problem
cites work: Single-machine scheduling with early and tardy completion costs
cites work: Performance Guarantees for Scheduling Algorithms
cites work: Applying tabu search with influential diversification to multiprocessor scheduling
cites work: A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
cites work: Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
cites work: Q3798122
cites work: The Single Machine Early/Tardy Problem
cites work: Improving the Efficiency of Tabu Search for Machine Sequencing Problems
cites work: Effective job shop scheduling through active chain manipulation
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: A new heuristic method for the flow shop sequencing problem
full work available at URL: s0377-2217(97)00261-0
OpenAlex ID: W2031479595
description: scientific article; zbMATH DE number 1782807