A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective

DOI10.1016/j.cor.2010.09.014zbMath1202.90150OpenAlexW2061587202MaRDI QIDQ614062

Rui Zhang, Cheng Wu

Publication date: 23 December 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.09.014

zbMATH Keywords

simulated annealingblocksnetwork flowsweighted tardinessshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem, A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective, Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics, Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation, Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters, Extended GRASP for the job shop scheduling problem with total weighted tardiness objective, A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations, An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria, Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem, A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem, Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
• Minimizing total weighted tardiness in a generalized job shop
• Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
• A filter-and-fan approach to the job shop scheduling problem
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• The job shop scheduling problem: Conventional and new solution techniques
• An efficient genetic algorithm for job shop scheduling with tardiness objectives.
• A large step random walk for minimizing total weighted tardiness in a job shop
• Decomposition methods for large job shops
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• Some new results on simulated annealing applied to the job shop scheduling problem
• Applying tabu search to the job-shop scheduling problem
• An advanced tabu search algorithm for the job shop problem
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
• Planning and Scheduling in Manufacturing and Services
• A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• Tabu Search—Part I
• Tabu Search—Part II
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Algorithms for Solving Production-Scheduling Problems
• Job Shop Scheduling by Local Search
• Scheduling