Volume 23, Issue 3 (IJIEPM 2012)                   2012, 23(3): 265-281 | Back to browse issues page

XML Persian Abstract Print

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

Using the Simulated Annealing to Solve a JIT Scheduling Problem in the Two-Machine Flow Shop. Journal title 2012; 23 (3) :265-281
URL: http://ijiepm.iust.ac.ir/article-1-945-en.html
Abstract:   (10131 Views)
A two-machine permutation flow shop scheduling with n independent jobs and different due dates is considered in this paper. Since this problem is shown to be NP-Hard, We use the simulated annealing to solve this problem. The objective is minimizing the weighted earliness and tardiness that cover JIT concept. We construct our algorithm in four scenarios with considering two Markov chains and two temperature reduction rates. The best scenario is proposed based on the results of computational experiments. A mathematical programming formulation is proposed for the problem, and the solution obtained by proposed SA algorithms are compared with the optimal ones obtained by mathematical model using LINGO software for small size instances. Also the performance of the best scenario is compared by the standard model of genetic algorithm for different sizes problems and its advantages are shown.
Full-Text [PDF 5201 kb]   (4660 Downloads)    

Add your comments about this article : Your username or Email:

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.