Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Approximation algorithms on multiple two-stage flowshops

From MaRDI portal
Publication:1791041
Jump to:navigation, search

DOI10.1007/978-3-319-94776-1_59OpenAlexW2810352541MaRDI QIDQ1791041

Guangwei Wu, Jian'er Chen

Publication date: 4 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94776-1_59


zbMATH Keywords

schedulingapproximation algorithmmakespanflowshops


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)


Related Items (3)

Scheduling two-stage jobs on multiple flowshops ⋮ Improved approximation algorithms for two-stage flowshops scheduling problem ⋮ A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops







This page was built for publication: Approximation algorithms on multiple two-stage flowshops

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1791041&oldid=14145160"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 08:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki