Flow-shop scheduling for three serial stations with the last two duplicate
type: Item
instance of: scholarly article
title: Flow-shop scheduling for three serial stations with the last two duplicate
zbMATH Open document ID: 1061.90044
author: Ahmet Bolat
author: Ibrahim Al-Harkan
author: Bandar Al-Harbi
published in: Computers \& Operations Research
publication date: 2004-11-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2116909
zbMATH Keywords: Scheduling
zbMATH Keywords: Serial and duplicate stations
zbMATH Keywords: Branch and bound
zbMATH Keywords: Genetic algorithm
MaRDI profile type: Publication
full work available at URL: j.cor.2003.08.010
OpenAlex ID: W2079033567
cites work: Scheduling duplicate serial stations in transfer lines
cites work: Modeling and Analysis of Three-Stage Transfer Lines with Unreliable Machines and Finite Buffers
cites work: Algorithms for real-time scheduling of jobs on mixed model assembly lines
cites work: A New Heuristic for Three-Machine Flow Shop Scheduling
cites work: Sequencing jobs for an automated manufacturing module with buffer
cites work: Total flowtime in no-wait flowshops with separated setup times.
cites work: Q3525910
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Flowshop scheduling with limited temporary storage
cites work: Two-Stage, Hybrid Flowshop Scheduling Problem
cites work: Two branch and bound algorithms for the permutation flow shop problem
cites work: A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
cites work: A genetic algorithm for flowshop sequencing
cites work: Q5485395
cites work: Q4692508
cites work: Q4220707
cites work: Q4079017
DOI: 10.1016/J.COR.2003.08.010
description: scientific article; zbMATH DE number 2116909