scientific article; zbMATH DE number 4130180

MaRDI QIDQ3032067zbMATH OpenFDO

Authors Peter Bachmann, Jochen Göpfert, Knut Richter

Publication date 1989

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)

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

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)