The permutation flow shop with buffers: A tabu search approach
type: Item
instance of: scholarly article
title: The permutation flow shop with buffers: A tabu search approach
zbMATH Open document ID: 1009.90039
DOI: 10.1016/S0377-2217(98)00017-4
author: Eugeniusz Nowicki
published in: European Journal of Operational Research
publication date: 2002-08-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1783226
zbMATH Keywords: scheduling
zbMATH Keywords: flow shop with buffers
zbMATH Keywords: local search
zbMATH Keywords: tabu search
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: Flowshop sequencing problems with limited buffer storage
cites work: A two-machine permutation flow shop scheduling problem with buffers
cites work: On two-machine scheduling with release and due dates to minimize maximum lateness
cites work: On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
cites work: A fast tabu search algorithm for the permutation flow-shop problem
cites work: Tabu Search—Part I
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Benchmarks for basic scheduling problems
full work available at URL: s0377-2217(98)00017-4
OpenAlex ID: W2114736096
description: scientific article; zbMATH DE number 1783226