Bicriterion scheduling in the two-machine flowshop

Abstract

Bicriterion scheduling problems have attracted the attention of many researchers, especially in the past decade. Although more than fifty papers 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 minimising makespan and number of tardy jobs and of makespan and total tardiness. Computational results are also presented.

Keywords:

• bicriterion
• scheduling
• two-machine flowshop