Total completion time minimization in a computer system with a server and two parallel processors
type: Item
instance of: scholarly article
title: Total completion time minimization in a computer system with a server and two parallel processors
zbMATH Open document ID: 1077.90024
author: S. Guirchoun
author: J.-C. Billaut
author: Patrick Martineau
published in: Computers \& Operations Research
publication date: 2004-11-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 2116906
zbMATH Keywords: Scheduling
zbMATH Keywords: Parallel machines
zbMATH Keywords: Single server
zbMATH Keywords: Hybrid flow shop
MaRDI profile type: Publication
full work available at URL: j.cor.2003.08.007
OpenAlex ID: W2051705648
cites work: Scheduling two parallel semiautomatic machines to minimize machine interference
cites work: Parallel machine scheduling problems with a single server
cites work: Parallel machine scheduling with a common server
cites work: Scheduling for parallel dedicated machines with a single server
cites work: A heuristic algorithm for minimizing mean flow time with unit setups
cites work: Two-Stage, Hybrid Flowshop Scheduling Problem
cites work: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
cites work: Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
cites work: Q3525910
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
DOI: 10.1016/J.COR.2003.08.007
description: scientific article; zbMATH DE number 2116906