A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times

Applied Mathematical Modelling

Volumn 39, Issue 22, 2015, Pages 6845-6859

  Mehdizadeh, Esmaeil ^a   Tavakkoli Moghaddam, Reza ^b   Yazdani, Mehdi ^a  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Family setup times; Parallel machines scheduling problem; Taguchi experimental design; Vibration damping optimization

Indexed keywords

BRANCH AND BOUND METHOD; COMBINATORIAL OPTIMIZATION; DAMPING; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; PRODUCTION CONTROL; SCHEDULING; STATISTICS;

COMBINATORIAL OPTIMIZATION PROBLEMS; FAMILY SET-UP TIME; IDENTICAL PARALLEL MACHINES; PARALLEL MACHINES SCHEDULING PROBLEM; TAGUCHI EXPERIMENTAL DESIGN; TAGUCHI EXPERIMENTAL-DESIGN METHOD; TOTAL WEIGHTED COMPLETION TIME; VIBRATION-DAMPING;

VIBRATIONS (MECHANICAL);

EID: 84947494845     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2015.02.027     Document Type: Article

References (53)

1. Ahn B.H., Hyun J.H. Single facility multi-class job scheduling. Comput. Oper. Res. 1990, 17(3):265-272.
2. Allahverdi A., Ng C.T., Cheng T.C.E., Kovalyov M.Y. A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 2008, 187(3):985-1032.
3. Schutten J.M.J., Leussink R.A.M. Parallel machine scheduling with release dates, due dates, and family setup times. Int. J. Prod. Econ. 1996, 46-47:119-125.
4. Cheng T.C.E., Kovalyov M.Y. Parallel machine batching and scheduling with deadlines. J. Sched. 2000, 3(2):109-123.
5. Webster S., Azizoglu M. Dynamic programming algorithms for scheduling parallel machines with family setup times. Comput. Oper. Res. 2001, 28(2):127-137.
6. Blazewicz J., Kovalyov M.Y. The complexity of two group scheduling problems. J. Sched. 2002, 5(6):477-485.
7. Azizoglu M., Webster S. Scheduling parallel machines to minimize weighted flowtime with family set-up times. Int. J. Prod. Res. 2003, 41(6):1199-1215.
8. Chen Z.L., Powell W.B. Exact algorithms for scheduling multiple families of jobs on parallel machines. Nav. Res. Logist. 2003, 50(7):823-840.
9. Lin B.M.T., Jeng A.A.K. Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs. Int. J. Prod. Econ. 2004, 91(2):121-134.
10. Dunstall S., Wirth A. A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. Eur. J. Oper. Res. 2005, 167(2):283-296.
11. Nessah R., Chu C., Yalaoui F. An exact method for pm/sds,ri/∑i=1nCi problem. Comput. Oper. Res. 2007, 34(9):2840-2848.
12. Shim S.H., Kim Y.D. A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property. Comput. Oper. Res. 2008, 35(3):863-875.
13. Park Y., Kim S., Lee Y.H. Scheduling jobs on parallel machines applying neural network and heuristic rules. Comput. Ind. Eng. 2000, 38(1):189-202.
14. Weng M.X., Lu J., Ren H. Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Int. J. Prod. Econ. 2001, 70(3):215-226.
15. Yi Y., Wang D.W. Tabu search for scheduling grouped jobs on parallel machines. J. Northeastern Univ. 2001, 22:188-191.
16. Mendes A.S., Muller F.M., Franca P.M., Moscato P. Comparing meta-heuristic approaches for parallel machine scheduling problems. Prod. Plan. Control 2002, 13:143-154.
17. Eom D.H., Shin H.J., Kwun I.H., Shim J.K., Kim S.S. Scheduling jobs on parallel machines with sequence-dependent family set-up times. Int. J. Adv. Manuf. Technol. 2002, 19(12):926-932.
18. Kim D.W., Kim K.H., Jang W., Chen F.F. Unrelated parallel machine scheduling with setup times using simulated annealing. Robot. Comput. Integr. Manuf. 2002, 18(3/4):223-231.
19. Monch L., Balasubramanian H., Fowler J.W., Pfund M.E. Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Comput. Oper. Res. 2005, 32(11):2731-2750.
20. Abdekhodaee A.H., Wirth A., Gan H.S. Scheduling two parallel machines with a single server: the general case. Comput. Oper. Res. 2006, 33(4):994-1009.
21. Armentano V.A., Filho M.F.d. Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach. Eur. J. Oper. Res. 2007, 183(1):100-114.
22. Logendran R., Mcdonell B., Smucker B. Scheduling unrelated parallel machines with sequence-dependent setups. Comput. Oper. Res. 2007, 34(11):3420-3438.
23. Tavakkoli-Moghaddam R., Mehdizadeh E. A new ILP model for identical parallel machine scheduling with family setup times minimizing the total weighted flow time by a GA. Int. J. Eng. Trans. A Basic 2007, 20(2):183-194.
24. Tavakkoli-Moghaddam R., Taheri F., Bazzazi M., Izadi M., Sassani F. Design of a GA for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Comput. Oper. Res. 2009, 36(12):3224-3230.
25. Behnamian J., Zandieh M., Fatemi Ghomi S.M.T. Parallel machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm. Expert Syst. Appl. 2009, 36(6):9637-9644.
26. Driessel R., Mnch L. Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times. Comput. Ind. Eng. 2011, 61(2):336-345.
27. Chang P.C., Chen S.H. Integrating dominance properties with GAs for parallel machine scheduling problems with setup times. Appl. Soft Comput. 2011, 11(1):1263-1274.
28. Vallada E., Ruiz R. A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 2011, 211(3):612-622.
29. Saricicek I., Celik C. Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness. Appl. Math. Model. 2011, 35(8):4117-4126.
30. Li K., Yang S.L., Ma H.W. A simulated annealing approach to minimize the maximum lateness on uniform parallel machines. Math. Comput. Model. 2011, 53(5-6):854-860.
31. Wang W.L., Wang H.Y., Zhao Y.W., Zhang L.P., Xu X.L. Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm. Comput. Oper. Res. 2013, 40(5):1196-1206.
32. Ruiz-Torres A.J., Paletta G., Pérez E. Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects. Comput. Oper. Res. 2013, 40(8):2051-2061.
33. Lin C.W., Lin Y.K., Hsieh H.T. Ant colony optimization for unrelated parallel machine Scheduling. Int. J. Adv. Manuf. Technol. 2013, 67(1-4):35-45.
34. E. Mehdizadeh, R. Tavakkoli-Moghaddam, Vibration damping optimization, in: Proc. of the Int. Conf. Operations Research 2008 - OR and Global Business, Germany, 3-5 September 2008.
35. E. Mehdizadeh, M.R. Tavarroth, S.M. Mousavi, Solving the stochastic capacitated location-allocation problem by using a new hybrid algorithm, in: The Proc. of the Int. Conf. of Recent Researches in Applied Mathematics, Greece, 2010, pp. 27-32.
36. Mehdizadeh E., Tavarroth M.R., Hajipour V. A new hybrid algorithm to optimize stochastic-fuzzy capacitated multi-facility location-allocation problem. J. Ind. Eng. 2011, 7:77-86.
37. Mousavi S.M., Niaki S.T.A., Mehdizadeh E., Tavarroth M.R. The capacitated multi-facility location-allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms. Int. J. Syst. Sci. 2013, 44(10):1897-1912.
38. Aliabadi M., Jolai F., Mehdizadeh E., Jenabi M. A flow shop production planning problem with basic period policy and sequence dependent set up times. J. Ind. Syst. Eng. 2011, 5(1):286-304.
39. Mehdizadeh E., Nezhad-Dadgar S. Using vibration damping optimization algorithm for resource constrained project scheduling problem with weighted earliness-tardiness penalties and interval due dates. Econ. Comput. Econ. Cybern. Stud. Res. (ECECSR) 2014, 48:331-343.
40. Molla-Alizadeh-Zavardehi S., Hajiaghaei-Keshteli M., Tavakkoli-Moghaddam R. Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation. Expert Syst. Appl. 2011, 38:10462-10474.
41. G. Taguchi, Introduction to quality engineering, White Plains: Asian Productivity Organization/UNIPUB, 1986.
42. Molla-Alizadeh-Zavardehi S., Sadi Nezhad S., Tavakkoli-Moghaddam R., Yazdani M. Solving a fuzzy fixed charge solid transportation problem by metaheuristics. Math. Comput. Model. 2013, 57:1543-1558.
43. Rostamian Delavar M., Hajiaghaei-Keshteli M., Molla-Alizadeh-Zavardehi S. Genetic algorithms for coordinated scheduling of production and air transportation. Expert Syst. Appl. 2010, 37:8255-8266.
44. Naderi B., Zandieh M., Roshanaei V. Scheduling hybrid flow shops with sequence dependent setup times to minimize makespan and maximum tardiness. Int. J. Adv. Manuf. Technol. 2008, 41(11/12):1186-1198.
45. Palm W.J. Mechanical Vibration 2007, John Wiley & Sons Inc., New York.
46. Thomson W.T. Theory of Vibration with Applications 1988, Prentice Hall, Englewood Cliffs, New Jersey.
47. Montgomery D.C. Design and Analysis of Experiments 2000, John Wiley & Sons, New York.
48. Jerne N.K. Towards a network theory of the immune system. Annu. Immunol. 1974, 125:373-389.
49. Al-Aomar R., Al-Okaily A. A GA-based parameter design for single machine turning process with high-volume production. Comput. Ind. Eng. 2006, 50:317-337.
50. Ross R.J. Taguchi Techniques for Quality Engineering 1989, McGraw-Hill, New York.
51. Phadke M.S. Quality Engineering using Robust Design 1989, Prentice-Hall, Sarmiento, NJ.
52. Tsai J.T., Ho W.H., Liu T.K., Chou J.H. Improved immune algorithm for global numerical optimization and job shop scheduling problems. Appl. Math. Comput. 2007, 194:406-424.
53. Naderi B., Zandieh M., Ghoshe Balagh A.K., Roshanaei V. An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst. Appl. 2009, 36:9625-9633.