A controlled search simulated annealing method for the single machine weighted tardiness problem

DOI10.1007/BF02022094zbMath0705.90040MaRDI QIDQ918386

Robert S. Sullivan, Hirofumi Matsuo, Chang Juck Suh

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

controlled search simulated annealingsingle machine weighted tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (15)

A tabu search algorithm for the single machine total weighted tardiness problem ⋮ Simulated annealing metaheuristics for the vehicle routing problem with time windows ⋮ A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems ⋮ Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters ⋮ Predictive-reactive scheduling on a single resource with uncertain future jobs ⋮ Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one ⋮ DLSP for two-stage multi-item batch production ⋮ Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling ⋮ Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs ⋮ A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM ⋮ Scheduling jobs on parallel machines with sequence-dependent setup times ⋮ An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling ⋮ Heuristics for minimizing total weighted tardiness in flexible flow shops ⋮ Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem ⋮ Simulated annealing for resource-constrained scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Nonstationary Markov chains and convergence of the annealing algorithm
• A decomposition algorithm for the single machine total tardiness problem
• On Scheduling Tasks with Associated Linear Loss Functions
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Convergence and finite-time behavior of simulated annealing
• Generalized Simulated Annealing for Function Optimization
• Simulated annealing methods with general acceptance probabilities
• Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods
• Cooling Schedules for Optimal Annealing
• Minimizing Total Costs in One-Machine Scheduling
• A dual algorithm for the one-machine scheduling problem
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• An experimental comparison of solution algorithms for the single-machine tardiness problem
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution

This page was built for publication: A controlled search simulated annealing method for the single machine weighted tardiness problem