BICRITERION SCHEDULING IN THE 2-MACHINE FLOWSHOP

Bicriterion scheduling problems have attracted the attention of many r esearchers, especially in the past decade. Although more than fifty pa pers have been published on this topic, most studies done so far focus only on a single machine. In this paper, we extend the development to the two-machine case and present algorithms for the bicriterion of mi nimising makespan and number of tardy jobs and of makespan and total t ardiness. Computational results are also presented.