A repairing technique for the local search of the job-shop problem.
type: Item
instance of: scholarly article
title: A repairing technique for the local search of the job-shop problem.
zbMATH Open document ID: 1053.90042
DOI: 10.1016/S0377-2217(02)00733-6
author: Boštjan Murovec
author: Peter Šuhel
published in: European Journal of Operational Research
publication date: 2004-01-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 2021186
zbMATH Keywords: Scheduling
zbMATH Keywords: Local search
zbMATH Keywords: Neighborhood function
zbMATH Keywords: Job-shop
MaRDI profile type: Publication
cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
cites work: Guided local search with shifting bottleneck for job shop scheduling
cites work: A generalized permutation approach to job shop scheduling with genetic algorithms
cites work: The job shop scheduling problem: Conventional and new solution techniques
cites work: A branch and bound algorithm for the job-shop scheduling problem
cites work: Applying tabu search to the job-shop scheduling problem
cites work: Tabu Search—Part I
cites work: Q4692508
cites work: Deterministic job-shop scheduling: Past, present and future
cites work: Effective neighbourhood functions for the flexible job shop problem
cites work: Q4891488
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Q4851825
cites work: Job Shop Scheduling by Local Search
cites work: Job Shop Scheduling by Simulated Annealing
full work available at URL: s0377-2217(02)00733-6
OpenAlex ID: W1980872196
description: scientific article; zbMATH DE number 2021186