Analysis and comparison of various lower-bounds on schedule times for the solution of flow-shop problems

K-REx Repository

This item appears in the following Collection(s)