A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
type: Item
instance of: scholarly article
title: A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
zbMATH Open document ID: 1202.90150
author: Rui Zhang
author: Cheng Wu
published in: Computers \& Operations Research
publication date: 2010-12-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5829374
zbMATH Keywords: shop scheduling
zbMATH Keywords: weighted tardiness
zbMATH Keywords: simulated annealing
zbMATH Keywords: blocks
zbMATH Keywords: network flows
MaRDI profile type: Publication
full work available at URL: j.cor.2010.09.014
OpenAlex ID: W2061587202
cites work: Q4124328
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Some new results on simulated annealing applied to the job shop scheduling problem
cites work: A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
cites work: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
cites work: Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
cites work: An advanced tabu search algorithm for the job shop problem
cites work: Q5692627
cites work: A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
cites work: Scheduling
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
cites work: Q4238569
cites work: A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
cites work: A large step random walk for minimizing total weighted tardiness in a job shop
cites work: An efficient genetic algorithm for job shop scheduling with tardiness objectives.
cites work: Decomposition methods for large job shops
cites work: Minimizing total weighted tardiness in a generalized job shop
cites work: Job Shop Scheduling by Local Search
cites work: The job shop scheduling problem: Conventional and new solution techniques
cites work: Job Shop Scheduling by Simulated Annealing
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Applying tabu search to the job-shop scheduling problem
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
cites work: Q3425131
cites work: Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
cites work: Planning and Scheduling in Manufacturing and Services
cites work: Algorithms for Solving Production-Scheduling Problems
cites work: A filter-and-fan approach to the job shop scheduling problem
DOI: 10.1016/J.COR.2010.09.014
description: scientific article; zbMATH DE number 5829374