scientific article; zbMATH DE number 425580

zbMATH Open0779.90037MaRDI QIDQ3136604FDOQ3136604

Authors: S. P. Bansal 

Publication date: 17 October 1993

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

Recommendations

• The two-machine total completion time flow shop problem
• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
• scientific article; zbMATH DE number 3854789
• scientific article; zbMATH DE number 1247725
• scientific article; zbMATH DE number 1319608

zbMATH Keywords

flowshopcritical path concepttighter lower bounds

Mathematics Subject Classification ID

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

Cited In (1)

• A new sufficient condition of optimality for the two-machine flowshop 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 Q3136604)