scientific article; zbMATH DE number 495274

MaRDI QIDQ4277263zbMATH OpenFDO

Authors Czesław Bajon

Publication date 24 February 1994

zbMATH Keywords

branch and boundheuristic algorithmalgebraic propertiespermutation flow-shopminimax objective function

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
• scientific article; zbMATH DE number 3891076
• Two branch and bound algorithms for the permutation flow shop problem
• scientific article; zbMATH DE number 3854789
• A computational study of the permutation flow shop problem based on a tight lower bound

Cited in

(3)

• scientific article; zbMATH DE number 3916005 (Why is no real title available?)
• Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
• Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems

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