Makespan Minimization for Flow-Shop Problems With Transportation Times and a Single Robot

Discrete Applied Mathematics - Netherlands
doi 10.1016/s0166-218x(00)00316-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV