Applying new dominance concepts to job schedule optimization

This paper deals with scheduling of independent jobs constrained by earliest starting times and latest finishing times on a single machine. The purpose is to find a feasible schedule which minimizes the total elapsed time. Based on the limit times of the jobs, a new dominance concept is defined. Associated with a branch and bound procedure, it significantly reduces the number of solutions to consider for solving the defined optimization problem. The efficiency of the proposed concept has been tested by computational experiments.