R. TavakoliMoghadam

[ 1 ] - A Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods

  In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...