A HEURISTIC FOR SEQUENCING PCBS WITH DUE-DATES

Addresses the problem of sequencing a set of PCBs on a single assembli ng machine. Considers two objectives, namely minimizing tardiness and minimizing the set-ups. Reduces component change-overs by exploiting t he similarity between PCBs. Proposes a new measure to sequence the PCB s, taking care of both the objectives. Develops a heuristic for solvin g the bicriteria problem. The proposed method performs better than the existing heuristics for the comparable situation of sequencing in a s ingle machine job-shop.