Approximation algorithms on multiple two-stage flowshops
type: Item
instance of: scholarly article
title: Approximation algorithms on multiple two-stage flowshops
DOI: 10.1007/978-3-319-94776-1_59
author: Guangwei Wu
author: Jianer Chen
publication date: 2018-10-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6946829
zbMATH Keywords: scheduling
zbMATH Keywords: flowshops
zbMATH Keywords: approximation algorithm
zbMATH Keywords: makespan
MaRDI profile type: Publication
full work available at URL: 978-3-319-94776-1 59
OpenAlex ID: W2810352541
Recommended article: Approximation algorithms for scheduling multiple two-stage flowshops
Recommended article: Approximation Algorithms for a Two-Stage Hybrid Flow Shop
Recommended article: Approximation algorithms for two-stage flexible flow shop scheduling
Recommended article: Improved approximation algorithms for two-stage flowshops scheduling problem
Recommended article: On scheduling multiple two-stage flowshops
Recommended article: A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
Recommended article: Improved approximation algorithms for two-stage flexible flow shop scheduling
Recommended article: A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
Recommended article: Q4623631
Recommended article: On Approximation Algorithms for Two-Stage Scheduling Problems
description: scientific article; zbMATH DE number 6946829