A simulated annealing approach for the one-machine mean tardiness scheduling problem
type: Item
instance of: scholarly article
title: A simulated annealing approach for the one-machine mean tardiness scheduling problem
zbMATH Open document ID: 0912.90171
DOI: 10.1016/0377-2217(95)00149-2
author: K. Appert
published in: European Journal of Operational Research
publication date: 1998-10-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1212205
zbMATH Keywords: simulated annealing
zbMATH Keywords: single machine mean tardiness scheduling
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00149-2
OpenAlex ID: W2093811690
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: A dual algorithm for the one-machine scheduling problem
cites work: Q3938812
cites work: Q3815120
cites work: A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
cites work: Optimization by Simulated Annealing
cites work: A decomposition algorithm for the single machine total tardiness problem
Recommended article: Simulated annealing algorithm for solving the single machine early/tardy problem
Recommended article: A controlled search simulated annealing method for the single machine weighted tardiness problem
Recommended article: Q4885615
Recommended article: A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
Recommended article: Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
Recommended article: A tabu search approach for the single machine mean tardiness problem
Recommended article: A simulated annealing approach to bicriteria scheduling problems on a single machine
Recommended article: Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
Recommended article: A simulated annealing algorithm for single machine scheduling problems with family setups
Recommended article: Solving Scheduling Problems by Simulated Annealing
description: scientific article; zbMATH DE number 1212205