Volume 19, Number 4 (IJIE 2008)                   IJIEPR 2008, 19(4): 47-56 | Back to browse issues page


XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

TavakoliMoghadam R, Vasei M. A Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods. IJIEPR. 2008; 19 (4) :47-56
URL: http://ijiepr.iust.ac.ir/article-1-6-en.html

, : tavakoli@ut.ac.ir
Abstract:   (4319 Views)

  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 compare the associated results, a branch-and-bound (B&B) method is designed and the upper/lower limits are also introduced in this method. To show the effectiveness of these methods, a number of different types of problems are generated and then solved. Based on the results of the test problems, the proposed SA has a small error, and computational time for achieving the best result is very small.

Full-Text [PDF 128 kb]   (1046 Downloads)    
Type of Study: Research | Subject: Material Managment
Received: 2009/04/18

Add your comments about this article : Your username or email:
Write the security code in the box

Send email to the article author


© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb