Solving flow shop sequencing problem for deteriorating jobs by using Electro Magnetic algorithm

Journal of Applied Sciences

Volumn 8, Issue 22, 2008, Pages 4121-4128

  Davoudpour, H ^a   Hadji Molana, M ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Computational complexity; Crisis event management; Machine scheduling; Make span; Meta heuristic

Indexed keywords

CRISIS EVENTS; DETERIORATING JOBS; MACHINE SCHEDULING; MAKE SPAN; META HEURISTIC ALGORITHM; METAHEURISTIC; REALISTIC ENVIRONMENTS; SEQUENCING PROBLEMS;

COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; SCHEDULING;

DETERIORATION;

EID: 67649616362     PISSN: 18125654     EISSN: 18125662     Source Type: Journal    
DOI: 10.3923/jas.2008.4121.4128     Document Type: Article

References (25)

1. Alidaee, N.K.W., 1999. Scheduling with time dependent processing times: Review and extensions. J. Operat. Res. Soc., 50: 711-720.
2. Birbil, S.I. and S.C. Fang, 2003. An Electromagnetism-like mechanism for global optimization. J. Global Optimiz., 25: 263-282.
3. Campbell, H.G., R.A. Dudek and M.L. Smith, 1970. A heuristic algorithm for the n-job, m-machine sequencing problem. Manage. Sci., 16: 630-637.
4. Cheng, T.C.E., Q. Ding and B.M.T. Lin, 2004. A concise survey of scheduling with time-dependent processing times. Eur. J. Operat. Res., 152: 1-13.
5. Gawiejnowicz, S., W. Kurc and L. Pankowska, 2006. Parallel machine scheduling of deteriorating jobs by modified steepest descent search. In: Parallel Processing and Applied Mathematics, 6th International Conference, September 11-14, Poznan, Poland, pp: 116-123.
6. Gupta, J.N.D. and S.K. Gupta, 1988. Single facility scheduling with nonlinear processing times Comput. Ind. Eng., 14: 387-393.
7. Hsieh, Y.C. and D.L. Bricker, 1997. Scheduling linearly deteriorating jobs on multiple machine. Comput. Ind. Eng., 32: 727-734.
8. Ji, M. and T.C.E. Cheng, 2008. Parallel-machine scheduling with simple linear deterioration to minimize total completion time Eur. J. Operat. Res., 188: 342-347.
9. Johnson, S.M., 1954. Optimal two and three stage production schedules with setup times included. Naval Res. Logist. Q., 1: 61-68.
10. Kang, L. and C.T. Ng, 2007. 'A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs. Int. J. Prod. Econ., 109: 180-184.
11. Khalil, S.H. and M. Samson, 2001. Scheduling linearly deteriorating jobs on parallel machines: A simulated annealing approach Prod. Plann. Control, 12: 76-80.
12. Kunnathur, A.S. and S.K. Gupta, 1990. Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problems. Eur. J. Operat. Res., 47: 56-64.
13. Lee, W.C, C.C. Wu, C.C. Wen and Y.H. Chung, 2007. A two-machine flowshop makespan scheduling problem with deteriorating jobs Comput. Ind. Eng., 54: 737-749.
14. Lee, W.C. and C.C. Wu, 2008. Multi-machine scheduling with deteriorating jobs and scheduled maintenance. Applied Math. Modell., 32: 362-373.
15. Mosheiov, G., 1994. Scheduling jobs under simple linear deterioration. Comput. Operat. Res., 21: 653-659.
16. Mosheiov, G., 1995. Scheduling jobs with step-deterioration, minimizing Makespan on a single and multi-machine Comput. Ind. Eng., 28: 869-879.
17. Mosheiov, G., 1998. Multi-machine scheduling with linear deterioration. INFOR., 36: 205-214.
18. Mosheiov, G., 2002. Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Applied Math., 117: 195-209.
19. Palmer, D.S., 1965. Sequencing Jobs through in a multi stage process in the minimum total time: A quick method of obtaining a near optimum. Operat. Res. Q., 16: 101-107.
20. Pinedo, M., 1995. Scheduling, Theory, Algorithms and Systems. 1st Edn. Prentice-hall, Englewood Cliffs, NJ.
21. Ruiz, R. and M. Concepcion, 2005. A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Operat. Res., 165: 479-494.
22. Sundararaghavan, P.S. and A.S. Kunnathur, 1994. Single machine scheduling with start time-dependent processing times: Some solvable cases. Eur. J. Operat. Res., 78: 394-403.
23. Taillard, 1993. Benchmark for basic scheduling problems. Eur. J. Operat. Res., 47: 278-285.
24. Wang, J.B., C.T. Daniel Ng, T.C.E. Cheng and L.L. Liu, 2006. Minimizing total completion time in a two-machine flow shop with deteriorating jobs Applied Math. Computat., 180: 185-193.
25. Wu, C.C. and W.C. Lee, 2006. Two-machine flowshop scheduling to minimize mean flow time under linear deterioration. Int. J. Prod. Econ., 103: 572-584.