The single machine sequencing problem is a specialized scheduling problem in which an ordering of the jobs completely determines a schedule. As simple as it is, however, the single machine case is still very important. But most of the past studies did...
The single machine sequencing problem is a specialized scheduling problem in which an ordering of the jobs completely determines a schedule. As simple as it is, however, the single machine case is still very important. But most of the past studies did not consider the setup time that can be prepared before job arrives, release date, and delivery time.
We proposed an optimal seeking algorithm for single machine sequencing problem considering before-arrival family setup time, release date, and delivery date using branch & bound method. Experimental result shows that the proposed single machine sequencing algorithm finds an optimal solution within small time limit.