International Journal of Industiral Engineering & Producion Research
نشریه بین المللی مهندسی صنایع و تحقیقات تولید
IJIEPR
Engineering & Technology
http://ijiepr.iust.ac.ir
18
agent2
2008-4889
2345-363X
10.22068/ijiepr
en
jalali
1387
9
1
gregorian
2008
12
1
19
4
online
1
fulltext
en
A Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods
Material Managment
Material Managment
پژوهشي
Research
<p> <i> 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/ET<sub>max</sub>). 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 <a name="OLE_LINK5"></a><a name="OLE_LINK4">branch-and-bound </a>(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. </i></p>
Single machine sequencing, Earliness/ tardiness, Idle insert, Simulated annealing, Branch-and-bound methods
47
56
http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-1-6&slc_lang=en&sid=en
R.
TavakoliMoghadam
: tavakoli@ut.ac.ir
`18003194753284600285`

18003194753284600285
Yes
M.
Vasei
`18003194753284600286`

18003194753284600286
No