Minimizing total flowtime and maximum job lateness in the two-machine flowshop system: a computerized algorithm Parthasarati Dileepan

摘要

This paper is an improvement to an extension of a previously published paper which considered the dual criteria of minimizing flowtime and maximum lateness of jobs in the two-machine flowshop system. We discover the conditions that determine which of the pairs of adjacent jobs in a sequence should precede the other to minimize either of the two objective functions. We also present a Branch-and-Bound procedure to arrive at and optimal solution, along with a computerized example problem.