Using tabu search to solve the common due date early/tardy machine scheduling problem
type: Item
instance of: scholarly article
title: Using tabu search to solve the common due date early/tardy machine scheduling problem
zbMATH Open document ID: 0889.90090
DOI: 10.1016/S0305-0548(96)00052-4
published in: Computers \& Operations Research
publication date: 1998-06-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1091587
zbMATH Keywords: tabu search
zbMATH Keywords: restricted, common-due-date, early/tardy machine scheduling
author: Ross J. W. James
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Q4495496
cites work: A tabu search experience in production scheduling
cites work: Improving the Efficiency of Tabu Search for Machine Sequencing Problems
cites work: Common due-date determination and sequencing using tabu search
cites work: An experimental comparison of solution algorithms for the single-machine tardiness problem
cites work: A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
full work available at URL: s0305-0548(96)00052-4
OpenAlex ID: W2062701203
description: scientific article; zbMATH DE number 1091587