A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem

DOI10.1016/j.cor.2017.09.017zbMath1391.90296OpenAlexW2755799179MaRDI QIDQ1652506

Yuichi Nagata, Isao Ono

Publication date: 11 July 2018

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

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

zbMATH Keywords

dynamic programmingmetaheuristicslocal searchjob shop scheduling

Mathematics Subject Classification ID

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

Related Items

A survey of job shop scheduling problem: the types and models ⋮ Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem

Cites Work

• Unnamed Item
• A tabu search/path relinking algorithm to solve the job shop scheduling problem
• Principles for the design of large neighborhood search
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
• A powerful route minimization heuristic for the vehicle routing problem with time windows
• The job shop scheduling problem: Conventional and new solution techniques
• Constraint-based job shop scheduling with Ilog Scheduler
• Deterministic job-shop scheduling: Past, present and future
• Guided local search and its application to the traveling salesman problem
• A very fast TS/SA algorithm for the job shop scheduling problem
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• An advanced tabu search algorithm for the job shop problem
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows
• Combining Constraint Programming and Local Search for Job-Shop Scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
• Algorithms for Solving Production-Scheduling Problems
• Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms

This page was built for publication: A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem