A controlled search simulated annealing method for the single machine weighted tardiness problem
type: Item
instance of: scholarly article
title: A controlled search simulated annealing method for the single machine weighted tardiness problem
zbMATH Open document ID: 0705.90040
DOI: 10.1007/BF02022094
author: Hirofumi Matsuo
author: Chang Juck Suh
author: Robert S. Sullivan
published in: Annals of Operations Research
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 4158360
zbMATH Keywords: controlled search simulated annealing
zbMATH Keywords: single machine weighted tardiness
MaRDI profile type: Publication
cites work: Simulated annealing methods with general acceptance probabilities
cites work: Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods
cites work: An experimental comparison of solution algorithms for the single-machine tardiness problem
cites work: Generalized Simulated Annealing for Function Optimization
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
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: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
cites work: Nonstationary Markov chains and convergence of the annealing algorithm
cites work: Cooling Schedules for Optimal Annealing
cites work: Optimization by Simulated Annealing
cites work: Q4124332
cites work: Q4124328
cites work: Convergence and finite-time behavior of simulated annealing
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
cites work: Minimizing Total Costs in One-Machine Scheduling
cites work: On scheduling tasks with associated linear loss functions
cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
cites work: On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
description: scientific article; zbMATH DE number 4158360