A large step random walk for minimizing total weighted tardiness in a job shop
type: Item
instance of: scholarly article
title: A large step random walk for minimizing total weighted tardiness in a job shop
zbMATH Open document ID: 0969.90045
author: Stephan Kreipl
published in: Journal of Scheduling
publication date: 2000-09-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1502132
zbMATH Keywords: job shop
zbMATH Keywords: total weighted tardiness
zbMATH Keywords: large step radom walk
MaRDI profile type: Publication
cites work: Q4238569
cites work: Job-shop scheduling: Computational study of local search and large-step optimization methods
cites work: Large-step Markov chains for the TSP incorporating local search heuristics
cites work: On a routing problem
cites work: Job Shop Scheduling by Local Search
cites work: A survey of priority rule-based scheduling
cites work: Optimization by Simulated Annealing
cites work: Q3809582
cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling
cites work: Global optimization
cites work: Tabu Search—Part I
cites work: A user's guide to tabu search
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Q4739657
cites work: Job Shop Scheduling by Simulated Annealing
cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
cites work: Applying tabu search to the job-shop scheduling problem
OpenAlex ID: W2051604785
DOI: 10.1002/(SICI)1099-1425(200005/06)3:3%3C125::AID-JOS40%3E3.0.CO;2-C
full work available at URL: https://doi.org/10.1002/(sici)1099-1425(200005/06)3:3%3C125::aid-jos40%3E3.0.co
description: scientific article; zbMATH DE number 1502132