An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
type: Item
instance of: scholarly article
title: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
zbMATH Open document ID: 0890.90097
DOI: 10.1023/A:1018930406487
author: Stèphane Dauzère-Pérès
author: Jan Paulli
published in: Annals of Operations Research
publication date: 1998-07-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1094937
zbMATH Keywords: suboptimal algorithms
zbMATH Keywords: sequencing
zbMATH Keywords: disjunctive graph model
zbMATH Keywords: job-shop scheduling
zbMATH Keywords: makespan
zbMATH Keywords: tabu search
MaRDI profile type: Publication
full work available at URL: a:1018930406487
OpenAlex ID: W159012016
Recommended article: Tabu search for the job-shop scheduling problem with multi-purpose machines
Recommended article: Q5702320
Recommended article: Solving a job-shop scheduling problem based on a tabu search algorithm
Recommended article: Tabu-search for the multi-mode job-shop problem
Recommended article: Applying tabu search to the job-shop scheduling problem
Recommended article: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
Recommended article: Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
Recommended article: A tabu search approach for proportionate multiprocessor open shop scheduling
Recommended article: A tabu search/path relinking algorithm to solve the job shop scheduling problem
Recommended article: An integrated tabu search algorithm for the lot streaming problem in job shops
description: scientific article; zbMATH DE number 1094937