scientific article; zbMATH DE number 4170627

MaRDI QIDQ3496141zbMATH OpenFDO

Authors Heidemarie Bräsel, Thomas Tautenhahn

Publication date 1989

zbMATH Keywords

assignmenttransversal theorybottleneckopen-shop problempolynomial approximate algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 3984949
• Publication:4936534
• The open shop scheduling problem
• Constructive heuristic algorithms for the open shop problem
• Approximation algorithms for parallel open shop scheduling

Cited in

(6)

• scientific article; zbMATH DE number 4020828 (Why is no real title available?)
• scientific article; zbMATH DE number 4072678 (Why is no real title available?)
• Constructive heuristic algorithms for the open shop problem
• scientific article; zbMATH DE number 3984949 (Why is no real title available?)
• Some positive news on the proportionate open shop problem
• scientific article; zbMATH DE number 4020829 (Why is no real title available?)

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 Q3496141)