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

DOI10.1016/J.COR.2015.07.011zbMath1349.90366OpenAlexW2208878817MaRDI QIDQ342161

Christian Bierwirth, Jens Kuhpfahl

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

zbMATH Keywords

heuristicsjob shop schedulingtotal weighted tardinessdisjunctive graph modelneighborhoods

Mathematics Subject Classification ID

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

Related Items (10)

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 ⋮ 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 ⋮ Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling ⋮ 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 ⋮ The job shop scheduling problem with convex costs ⋮ The evolution of schematic representations of flow shop scheduling problems

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
• Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
• A general approach for optimizing regular criteria 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 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
• Benchmarks for basic scheduling problems
• Applying tabu search to the job-shop scheduling problem
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• Complex Scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• A Fast Taboo Search Algorithm for the Job Shop Problem
• New dispatching rules for shop scheduling: A step forward

This page was built for publication: A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective