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.014zbMATH Open1202.90150OpenAlexW2061587202MaRDI QIDQ614062FDOQ614062

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

Recommendations

• A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
• A hybrid differential evolution and tree search algorithm for the job shop scheduling problem
• Scheduling in flowshops to minimize total tardiness of jobs

zbMATH Keywords

simulated annealingnetwork flowsblocksweighted tardinessshop scheduling

Mathematics Subject Classification ID

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

Cites Work

• Tabu Search—Part I
• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
• Scheduling
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• Applying tabu search to the job-shop scheduling problem
• Scheduling algorithms
• Job Shop Scheduling by Simulated Annealing
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Algorithms for Solving Production-Scheduling Problems
• Tabu Search—Part II
• 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
• Title not available (Why is that?)
• Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
• The job shop scheduling problem: Conventional and new solution techniques
• Planning and Scheduling in Manufacturing and Services
• Job Shop Scheduling by Local Search
• Some new results on simulated annealing applied 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
• A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
• A filter-and-fan approach to the job shop scheduling problem
• Minimizing total weighted tardiness in a generalized job shop
• An efficient genetic algorithm for job shop scheduling with tardiness objectives.
• An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
• Title not available (Why is that?)

Cited In (13)

• An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
• A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations
• Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry
• Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
• 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
• Title not available (Why is that?)
• Corrigendum to ``A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
• 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

This page was built for publication: A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q614062)