A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
From MaRDI portal
Publication:614062
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
Cites work
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- scientific article; zbMATH DE number 2209650 (Why is no real title available?)
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A filter-and-fan approach to the job shop scheduling 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 large step random walk for minimizing total weighted tardiness in a job shop
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
- A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- Algorithms for Solving Production-Scheduling Problems
- An advanced tabu search algorithm for the job shop problem
- An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- Applying tabu search to the job-shop scheduling problem
- Decomposition methods for large job shops
- Job Shop Scheduling by Local Search
- Job Shop Scheduling by Simulated Annealing
- Minimizing total weighted tardiness in a generalized job shop
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Planning and Scheduling in Manufacturing and Services
- Scheduling
- Scheduling algorithms
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- Some new results on simulated annealing applied to the job shop scheduling problem
- Tabu Search—Part I
- Tabu Search—Part II
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The job shop scheduling problem: Conventional and new solution techniques
Cited in
(15)- A hybrid differential evolution and tree search algorithm for the job shop scheduling problem
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry
- 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
- A simulation-based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations
- 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
- scientific article; zbMATH DE number 6263695 (Why is no real title available?)
- 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
- A permutation-based neighborhood for the blocking job-shop problem with total tardiness minimization
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)
