Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration

Advances in Engineering Software

Volumn 47, Issue 1, 2012, Pages 1-6

  Bank, M ^a   Fatemi Ghomi, S M T ^a   Jolai, F ^b   Behnamian, J ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Deteriorating job; Flow shop; Particle swarm optimization; Scheduling; Simulated annealing; Total tardiness

Indexed keywords

ALGORITHMS; DETERIORATION; MACHINE SHOP PRACTICE; PARTICLE SWARM OPTIMIZATION (PSO); PROBLEM SOLVING; SCHEDULING;

DETERIORATING JOBS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; JOB SEQUENCES; LINEAR DETERIORATION; LOCAL SEARCH; NEAR-OPTIMAL SOLUTIONS; PARTICLE SWARM; PARTICLE SWARM OPTIMIZATION ALGORITHM; PERMUTATION FLOW-SHOP SCHEDULING; PROCESSING TIME; QUALITY OF SOLUTION; SIMULATED ANNEALING ALGORITHMS; TOTAL TARDINESS; WAITING-TIME;

SIMULATED ANNEALING;

EID: 84455194528     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.advengsoft.2011.12.001     Document Type: Article

References (23)

1. J.N.D. Gupta, and S.K. Gupta Single facility scheduling with nonlinear processing times Comput Ind Eng 14 1998 387 393
2. B. Alidaee, and N.K. Womer Scheduling with time dependent processing times: review and extensions J Oper Res Soc 50 1999 711 720
3. T.C.E. Cheng, Q. Ding, and B.M.T. Lin A concise survey of scheduling with time-dependent processing times Eur J Oper Res 152 2004 1 3
4. G. Mosheiov Scheduling jobs under simple linear deterioration Comput Oper Res 21 1994 653 659
5. A. Bachman, and A. Janiak Minimizing maximum lateness under linear deterioration Eur J Oper Res 126 2000 557 566
6. G. Mosheiov Multi-machine scheduling with linear deterioration INFOR 36 1998 205 214 (Pubitemid 128645105)
7. S. Mhlanga, and K. Hindi Scheduling linearly deteriorating jobs on parallel machines: a simulated annealing approach Prod Plan Control 12 2001 76:80
8. A. Kononov, and S. Gawiejnowicz NP-hard cases in scheduling deteriorating jobs on dedicated machines J Oper Res Soc 52 2001 708 717 (Pubitemid 32609075)
9. C.L. Zhao, Q.L. Zhang, and H.Y. Tang Scheduling problems under linear deterioration Acta Automatica Sinica 29 2003 531 535
10. W.C. Lee, C.C. Wu, C.C. Wen, and Y.H. Chung A two-machine flow shop makespan scheduling problem with deteriorating jobs Comput Ind Eng 54 2008 737 749
11. H. Davoudpour, and M. Hadji Molana Solving flow shop sequencing problem for deteriorating jobs by using electromagnetic algorithm J Appl Sci 8 2008 4121 4128
12. Alagheband SA, Davoudpour H, Hashemi Doulabi SH, Khatibi M. Using a modified simulated annealing algorithm to minimize makespan in a permutation flow-shop scheduling problem with job deterioration. In: Proceedings of the world congress on engineering and computer science, 20-22 October, 2009 San Francisco, USA.
13. J. Layegh, F. Jolai, and M.S. Amalnik A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration Adv Eng Softw 40 2009 1074 1077
14. Kennedy J, Eberhart R. Particle Swarm Optimization. In: Proceedings of the IEEE international conference on neural networks piscataway: IEEE 11995; 4: 1942-8.
15. M.F. Tagetiren, and Y.C. Liang A binary particle swarm optimization algorithm for lot sizing problem J Econ Soc Res 5 2003 1 20
16. Tasgetiren MF, Liang YH, Sevkli, Gencyilmaz G. Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of the congress on evolutionary computation, June 20-23, 2004 Portland, Oregon. p. 1412-9.
17. C.J. Liao, C.T. Tseng, and P. Luarn A discrete version of particle swarm optimization for flowshop scheduling problems Comput Oper Res 34 2007 3099 3111 (Pubitemid 46356739)
18. M. Fatih, M.F. Tasgetiren, Y.C. Liang, M. Sevkli, and G. Gencyilmaz Particle swarm optimization algorithm for makespan and total flow time minimization in the permutation flow shop sequencing problem Eur J Oper Res 177 2007 1930 1947 (Pubitemid 44780934)
19. Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang A discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem Comput Oper Res 35 2008 2807 2839
20. C.T. Ng, J.B. Wang, T.C.E. Cheng, and L.L. Liu A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs Comput Oper Res 37 2010 83 90
21. A. Salman, I. Ahmad, and S. Al-Madani Particle swarm optimization for tast assignment problem Microprocess Microsy 26 2003 363 371
22. C.S. Chung, J. Flynn, and O. Kirca A branch and bound algorithm to minimize the total tardiness for m-machine permutation flow shop problems Eur J Oper Res 174 2006 1 10 (Pubitemid 44866836)
23. E. Vallada, R. Ruiz, and G. Minella Minimizing total tardiness in the m-machine flow shop problem: a review and evaluation of heuristics and metaheuristics Comput Oper Res 35 2008 1350 1373 (Pubitemid 47404775)