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

Authors:
Roland Braune;Günther Zäpfel;Michael Affenzeller
Affiliations:
Institute of Production and Logistics Management, Johannes Kepler University, Linz, Austria 4040;Institute of Production and Logistics Management, Johannes Kepler University, Linz, Austria 4040;Department of Software Engineering, Upper Austria University of Applied Sciences, Hagenberg, Austria 4232
Venue:
Journal of Scheduling
Year:
2013

Citing 13
Cited 0

Priority rules for job shops with weighted tardiness costs

Management Science
Applying tabu search to the job-shop scheduling problem

Annals of Operations Research - Special issue on Tabu search
New search spaces for sequencing problems with application to job shop scheduling

Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
An Advanced Tabu Search Algorithm for the Job Shop Problem

Journal of Scheduling
Minimizing Total Weighted Tardiness in a Generalized Job Shop

Journal of Scheduling
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem

Computers and Operations Research
A very fast TS/SA algorithm for the job shop scheduling problem

Computers and Operations Research
A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

Computers and Operations Research
A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective

Computers and Operations Research
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

Computers and Operations Research
A global constraint for total weighted completion time for unary resources

Constraints
Scheduling shops to minimize the weighted number of late jobs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Exact move evaluation in local search-based job shop scheduling is known to be time consuming, especially for medium and large size instances. Therefore, approximation functions providing quick estimates for the cost induced by a move are often used in order to accelerate the search process. This paper describes the generalization of an existing cost estimation function for insertion moves towards min-sum objectives, such as total weighted tardiness, total weighted completion time and total weighted number of late jobs. Besides the transfer of the concept itself, shortcomings of the original approach are identified and eliminated and an enhanced approximation scheme is presented. The final estimation function is able to provide a considerably increased accuracy for the considered min-sum objectives compared to the existing approach. The advantage of the new function emerges most clearly when it is embedded into a tabu search algorithm, as verified based on benchmark instances from literature involving up to 100 jobs and 20 machines.