Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 4130180

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

zbMATH Open0689.90046MaRDI QIDQ3032067FDOQ3032067


Authors: Peter Bachmann, Jochen Göpfert, Knut Richter Edit this on Wikidata


Publication date: 1989



Title of this publication is not available (Why is that?)



Recommendations

  • A note on permutation flow shop problem
  • On the heuristic solution of the permutation flow shop problem by path algorithms
  • A linear time approximation algorithm for permutation flow shop scheduling
  • A fast tabu search algorithm for the permutation flow-shop problem
  • Approximation algorithms for the parallel flow shop problem


zbMATH Keywords

approximationassignmentdigraphpermutation flow shopminimal average length of a path


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)







This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3032067)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3032067&oldid=16077907"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:39. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki