Job-shop local-search move evaluation without direct consideration of the criterion's value

DOI10.1016/J.EJOR.2014.08.044MaRDI QIDQ2629670zbMATH OpenOpenAlexFDO

Authors Boštjan Murovec

Publication date 6 July 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2014.08.044

zbMATH Keywords

job-shoplocal searchmakespanmove evaluationscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• 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
• scientific article; zbMATH DE number 2209650
• Job Shop Scheduling by Local Search
• A repairing technique for the local search of the job-shop problem.

Cites work

• A Fast Taboo Search Algorithm for the Job Shop Problem
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• A repairing technique for the local search of the job-shop problem.
• A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
• A very fast TS/SA algorithm for the job shop scheduling problem
• An advanced tabu search algorithm for the job shop problem
• Applying tabu search to the job-shop scheduling problem
• Benchmarks for basic scheduling problems
• Combining constraint programming and local search for job-shop scheduling
• Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
• Deterministic job-shop scheduling: Past, present and future
• 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
• scientific article; zbMATH DE number 1488092 (Why is no real title available?)
• scientific article; zbMATH DE number 925015 (Why is no real title available?)
• scientific article; zbMATH DE number 2209650 (Why is no real title available?)
• Job Shop Scheduling by Local Search
• Job Shop Scheduling by Simulated Annealing
• New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling

Cited in

(2)

• Alternative evaluation functions for the cyclic bandwidth sum problem
• Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation

This page was built for publication: Job-shop local-search move evaluation without direct consideration of the criterion's value

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629670)