Hybrid electromagnetism-like algorithm for the flowshop scheduling with sequence-dependent setup times

Journal of Applied Sciences

Volumn 8, Issue 20, 2008, Pages 3621-3629

  Mirabi, M ^a   Fatemi Ghomi, S M T ^a   Jolai, F ^b   Zandieh, M ^c  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

^c SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

Electromagnetism like algorithm; Flowshop; Hybrid meta heuristics; Scheduling; Sequence dependent setup times

Indexed keywords

COMPLEX ENVIRONMENTS; ELECTROMAGNETISM-LIKE ALGORITHM; FLOW-SHOPS; HYBRID METAHEURISTICS; OPTIMIZATION CRITERIA; PERMUTATION FLOW-SHOP SCHEDULING; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; SEQUENCE-DEPENDENT SETUP TIME;

ELECTROMAGNETISM; OPTIMIZATION; SCHEDULING ALGORITHMS;

SCHEDULING;

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

References (19)

1. Allahverdi, A., C.T. Ng, T.C.E. Cheng and Y.M. Kovalyov, 2008. A survey of scheduling problems with setup times or costs. Eur. J. Operat. Res., 187: 985-1032.
2. Chang, P.C., S.S. Chen and C.Y. Fan, 2007. A hybrid electromagnetism-like algorithm for single machine scheduling problem, Expert Sys. Applied, 10.1016/j.eswa.2007.11.050
3. Das, S.R. and C. Canel, 2005. An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system. Int. J. Prod. Econ., 97: 247-262.
4. Debels, D., B. De Reyck, R. Leus and M. Vanhoucke, 2006. A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. Eur. J. Oper. Res., 169: 638-653.
5. Ekşioǧlu, B., S.D. Ekpiǒlu and P. Jain, 2008. A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods. Comput. Industrial Eng., 54: 1-11.
6. Gupta, S.R. and J.S. Smith, 2006. Algorithms for single machine total tardiness scheduling with sequence dependent setups. Eur. J. Operat. Res., 175: 722-739.
7. Norman, B.A., 1999. Scheduling flowshops with finite buffers and sequence-dependent setup times. Comput. Ind. Eng., 36: 163-177.
8. Rios-Mercado, R.Z. and J.F. Bard, 1988. Computational experience with a branch-and-cut algorithm for l f owshop scheduling with setups. Comput. Operat. Res., 25: 351-366.
9. Rios-Mercado, R.Z. and J.F. Bard, 1999a. A branch-and-bound algorithm for permutation flowshops with sequence-dependent setup times. TIE Trans., 31: 721-731.
10. Rios-Mercado, R.Z. and J.F. Bard, 1999b. An enhanced TSP-based heuristic for makespan minimization in a flowshop with setup times. J. Heurist., 5: 53-70.
11. Rios-Mercado, R.Z. and J.F. Bard, 2003. The flowshop scheduling polyhedron with setup times. J. Comb. Optim., 7: 291-318.
12. Ruiz, R. and M. Concepcion, 2005. A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Operat. Res., 165: 479-494.
13. Ruiz, R., C. Maroto and J. Alcaraz, 2005. Solving the l f owshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur. J. Operat. Res., 165: 34-54.
14. Ruiz, R. and T. Stiitzle, 2008. An Iterated Greedy heuristic for the sequence-dependent setup time flowshop problem with makespan and weighted tardiness objectives. Eur. J. Operat. Res., 187: 1143-1159.
15. Stafford, Jr. E.E. and F.T. Tseng, 1990. On the Srikar-Ghosh MILP model for the N×M SDST flowshop problem. Int. J. Prod. Res., 28: 1817-1830.
16. Stafford, E. F. and F.T. Tseng, 2002. Two models for a family of flowshop sequencing problems. Eur. J. Operat. Res., 142: 282-293.
17. Sun, J.U. and H. Hwang, 2001. Scheduling problem in a two machine flow line with the N-step prior-job-dependent set-up times. Int. J. Syst. Sci., 32: 375-385.
18. Tseng, F.T. and E.E. Stafford Jr., 2001. Two MILP models for the N×M SDST flowshop sequencing problem. Int. J. Prod. Res., 39: 1777-1809.
19. Tseng, F.T., J.N.D. Gupta and E.F. Stafford, 2005. A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times. J. Opl. Res. Soc., 57: 541-551.