A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
From MaRDI portal
(Redirected from Publication:342161)
Recommendations
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- A neighborhood for complex job shop scheduling problems with regular objectives
- Minimizing total weighted tardiness in a generalized job shop
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
Cites work
- scientific article; zbMATH DE number 4079162 (Why is no real title available?)
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- scientific article; zbMATH DE number 925015 (Why is no real title available?)
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- A large step random walk for minimizing total weighted tardiness in a job shop
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
- Applying tabu search to the job-shop scheduling problem
- Benchmarks for basic scheduling problems
- Complex Scheduling
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- Guided local search with shifting bottleneck for job shop scheduling
- Job Shop Scheduling by Simulated Annealing
- New dispatching rules for shop scheduling: A step forward
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cited in
(17)- Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- A survey of job shop scheduling problem: the types and models
- Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems
- Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems
- The evolution of schematic representations of flow shop scheduling problems
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
- 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
- A permutation-based neighborhood for the blocking job-shop problem with total tardiness minimization
- An intensification approach based on fitness landscape characteristics for job shop scheduling problem
- Minimizing total weighted tardiness in a generalized job shop
- Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling
- A job scheduling and rejection problem considering self-contained and cross-functional jobs
- The job shop scheduling problem with convex costs
This page was built for publication: A study on local search neighborhoods 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 Q342161)
