Volume 24, Issue 1 (IJIEPM 2013)                   2013, 24(1): 1-12 | Back to browse issues page

XML Persian Abstract Print

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

zare mehrjerdi Y, Feraidouni S, Emami ئشهذخیه L. An Efficient Hybrid Algorithm for Solving Multiple Objective Linear Programming Single-Machine Scheduling Problems. Journal title 2013; 24 (1) :1-12
URL: http://ijiepm.iust.ac.ir/article-1-550-en.html
Yazd University , yazm2000@yahoo.com
Abstract:   (15084 Views)
Since the determination of efficient scheduling plans in sequencing problems with various criterions is considered an important problem, hence in this article a single machine sequencing problem with the minimization type delay and the total weighted lateness objectives are being studied. In this article, the applications of new optimization techniques in sequencing problems and scheduling are taken into consideration. The mathematical formulation of the objective functions are presented first and then after giving some high points on the topics of simulated annealing and genetic algorithm as our searching techniques, their efficiencies in the related problem is examined. At the end, for increasing the model efficiency a hybrid algorithm based upon the Simulation Annealing and Genetic Algorithm for the proposed problem is introduced. This approach demonstrates a set of efficient sequences as the minimization type objectives.
Full-Text [PDF 609 kb]   (10393 Downloads)    
Type of Study: Research | Subject: Manufacturing Process and Systems
Received: 2011/04/26 | Accepted: 2013/07/13 | Published: 2013/07/13

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

Send email to the article author

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