(A) two-machine no-wait flow shop sequencing problem with bicriteria of makespan and maximum tardiness

Abstract

This thesis analyzes a scheduling problem of a two-machine no-wait, flow shop incorporating both criteria of makespan and maximum tardiness. For the problem, several dominant solution properties are characterized and used to exploit a branch-and-bound algorithm and a heuristic algorithm. And two special cases of the problem are also investigated; one case where each job has the equal processing time on both machines and the other case where the first machine dominates the other one. Various numerical examples are presented to illustrate the solution procedures, respectively.