Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation

DOI10.1007/s10951-012-0305-xzbMath1297.90034OpenAlexW1975498203MaRDI QIDQ398881

Günther Zäpfel, Michael Affenzeller, Roland Braune

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-012-0305-x

zbMATH Keywords

local searchjob shop schedulingcost estimationmin-sum objectivemove evaluation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (5)

Job-shop local-search move evaluation without direct consideration of the criterion's value ⋮ 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 general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems ⋮ Extended GRASP for the job shop scheduling problem with total weighted tardiness objective

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Minimizing total weighted tardiness in a generalized job shop
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
• An efficient genetic algorithm for job shop scheduling with tardiness objectives.
• A large step random walk for minimizing total weighted tardiness in a job shop
• Scheduling shops to minimize the weighted number of late jobs
• Benchmarks for basic scheduling problems
• Applying tabu search to the job-shop scheduling problem
• A very fast TS/SA algorithm for the job shop scheduling problem
• A global constraint for total weighted completion time for unary resources
• 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
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• On a routing problem
• A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Disjunctive Programming
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm

This page was built for publication: Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation