A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective

DOI10.1016/J.COR.2015.07.011zbMATH Open1349.90366OpenAlexW2208878817MaRDI QIDQ342161FDOQ342161

Authors: J. Kuhpfahl, C. Bierwirth 

Publication date: 17 November 2016

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

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

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

zbMATH Keywords

heuristicsjob shop schedulingtotal weighted tardinessdisjunctive graph modelneighborhoods

Mathematics Subject Classification ID

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

Cites Work

• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Applying tabu search to the job-shop scheduling problem
• Complex Scheduling
• Job Shop Scheduling by Simulated Annealing
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Benchmarks for basic scheduling problems
• Guided local search with shifting bottleneck for job shop scheduling
• A large step random walk for minimizing total weighted tardiness in a job shop
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• Title not available (Why is that?)
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• 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
• Title not available (Why is that?)
• Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
• New dispatching rules for shop scheduling: A step forward
• Title not available (Why is that?)

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
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
• 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
• 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
• A job scheduling and rejection problem considering self-contained and cross-functional jobs
• Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling
• Minimizing total weighted tardiness in a generalized job shop
• The job shop scheduling problem with convex costs

Uses Software

• OR-Library

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)