One Machine scheduling problem with release dates and tow criteria

Abstract EN

This paper presents a branch and bound algorithm for sequencing a set of jobs on a single machine scheduling with the objective of minimizing total cost of flow time and number of tardy jobs, when the jobs may have unequal ready times.

Lower bound; efficient solutions, dominance rules for this problem and a computational experience will also be included.

Computational experience with instances having up to 40 jobs shows that the lower bound is effective in restricting the search.