A two-machine permutation flow shop scheduling problem with buffers
type: Item
instance of: scholarly article
title: A two-machine permutation flow shop scheduling problem with buffers
zbMATH Open document ID: 0917.90201
DOI: 10.1007/BF01539740
author: Czesław Smutnicki
published in: OR Spektrum
publication date: 1999-04-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 1281648
zbMATH Keywords: scheduling
zbMATH Keywords: heuristics
zbMATH Keywords: two-machine flow-shop
zbMATH Keywords: buffer
zbMATH Keywords: tabu search
zbMATH Keywords: just-in-time
zbMATH Keywords: flexible manufacturing systems
zbMATH Keywords: minimum makespan
zbMATH Keywords: two-machine permutation flow-shop
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
cites work: A block approach for single-machine scheduling with release dates and due dates
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: New results in the worst-case analysis for flow-shop scheduling
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: A fast tabu search algorithm for the permutation flow-shop problem
cites work: Flowshop scheduling with limited temporary storage
cites work: Some efficient heuristic methods for the flow shop sequencing problem
full work available at URL: https://doi.org/10.1007/bf01539740
OpenAlex ID: W2030527516
description: scientific article; zbMATH DE number 1281648