Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time

Harun Aydilek, Ali Allahverdi. Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time. Computers & Mathematics with Applications, 59(2):684-693, 2010. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.