The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm

Can Akkan, Selçuk Karabati. The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. European Journal of Operational Research, 159(2):420-429, 2004. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.