A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem
type: Item
instance of: scholarly article
title: A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem
zbMATH Open document ID: 1391.90296
author: Yuichi Nagata
author: Isao Ono
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901529
zbMATH Keywords: local search
zbMATH Keywords: dynamic programming
zbMATH Keywords: job shop scheduling
zbMATH Keywords: metaheuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2017.09.017
OpenAlex ID: W2755799179
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Guided local search with shifting bottleneck for job shop scheduling
cites work: Combining constraint programming and local search for job-shop scheduling
cites work: The job shop scheduling problem: Conventional and new solution techniques
cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme
cites work: Principles for the design of large neighborhood search
cites work: Algorithms for Solving Production-Scheduling Problems
cites work: An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
cites work: Deterministic job-shop scheduling: Past, present and future
cites work: A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows
cites work: A powerful route minimization heuristic for the vehicle routing problem with time windows
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: An advanced tabu search algorithm for the job shop problem
cites work: Constraint-based job shop scheduling with Ilog Scheduler
cites work: A tabu search/path relinking algorithm to solve the job shop scheduling problem
cites work: Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
cites work: Q3184605
cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
cites work: Guided local search and its application to the traveling salesman problem
cites work: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
cites work: A very fast TS/SA algorithm for the job shop scheduling problem
DOI: 10.1016/J.COR.2017.09.017
Recommended article: Guided local search with shifting bottleneck for job shop scheduling
Recommended article: Efficient local search algorithms for job-shop scheduling problems
Recommended article: A tabu search method guided by shifting bottleneck for the job shop scheduling problem
Recommended article: A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
Recommended article: A Computational Study of Local Search Algorithms for Job Shop Scheduling
Recommended article: Job-shop scheduling: Computational study of local search and large-step optimization methods
Recommended article: Q4495197
Recommended article: Q3624067
description: scientific article; zbMATH DE number 6901529