An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
type: Item
instance of: scholarly article
title: An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
zbMATH Open document ID: 0846.90049
DOI: 10.1016/0166-218X(95)00040-X
author: Alain Hertz
author: Marino Widmer
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 897386
zbMATH Keywords: tabu search
zbMATH Keywords: flexible manufacturing systems
zbMATH Keywords: heuristic
zbMATH Keywords: \(m\)-machine, \(n\)-job shop scheduling
zbMATH Keywords: tooling constraints
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: A tabu search experience in production scheduling
cites work: A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems
cites work: Applying tabu search to the job-shop scheduling problem
cites work: Tabu search techniques. A tutorial and an application to neural networks
cites work: Q4319400
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: A user's guide to tabu search
cites work: The tabu search metaheuristic: How we used it
cites work: Q4365130
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
cites work: Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
cites work: Job Shop Scheduling by Simulated Annealing
cites work: A new heuristic method for the flow shop sequencing problem
full work available at URL: 0166-218x(95)00040-x
OpenAlex ID: W2024649039
description: scientific article; zbMATH DE number 897386