A heuristic for sequencing PCBs with due‐dates

Addresses the problem of sequencing a set of PCBs on a single assembling machine. Considers two objectives, namely minimizing tardiness and minimizing the set‐ups. Reduces component change‐overs by exploiting the similarity between PCBs. Proposes a new measure to sequence the PCBs, taking care of both the objectives. Develops a heuristic for solving the bi‐criteria problem. The proposed method performs better than the existing heuristics for the comparable situation of sequencing in a single machine job‐shop.