A single-machine bicriterion scheduling problem with setup times

摘要

To address the issues pertaining to a single-machine bi-criterion scheduling problem where the jobs fall into several classes. A sequence independent setup time is required in problems where the jobs fall into several classes when the process is to be switched from one class to another. The study aims at finding an optimal schedule that minimizes the total completion time, subject to a constraint that each job must finish before its deadline. An exact solution involving a lower bound is proposed to tackle this problem using a set of theorems.