Editorial member


Ali Allahverdi, Department of Industrial and Management Systems Eng., Kuwait University, Kuwait
Email: ali.allahverdi@ku.edu.kw
Tel.: (+965) 24987874 (Office)


Ali Allahverdi

1.Allahverdi, A., Aydilek, H., Aydilek, A. 2018. No-wait flowshop scheduling problem with two criteria; total tardiness and makespan. European Journal of Operational Research (to appear).

2.Aydilek, A., Aydilek, H., & Allahverdi, A. 2017. Minimising maximum tardiness in assembly flowshops with setup times. International Journal of Production Research, 1-25.

3. Aydilek, A., Aydilek, H., & Allahverdi, A. 2017. Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times. Applied Mathematical Modelling, 45, 982-996.

Aydilek, A., Aydilek, H., Allahverdi, A., 2017. Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times. Applied Mathematical Modelling 45, 982-996.

4. Allahverdi, A., 2016. A survey of scheduling problems with no-wait in process. European Journal of Operational Research 255, 665-686.

5. Allahverdi, A., Aydilek, A., Aydilek, H., 2016. Minimizing the number of tardy jobs in assembly flowshops. Journal of Industrial and Production Engineering 33, 391-403.

6. Allahverdi, A., Aydilek, A., Aydilek, H., 2016. Two-stage assembly scheduling problem to minimize total tardiness with setup times. Applied Mathematical Modelling 40, 7796-7815.

7. Aldowaisan, T., Allahverdi, A., 2016. Continuous improvement in the Industrial and Management Systems Engineering Program at Kuwait University. European Journal of Engineering Education 41, 369-379.

8. Aldowaisan, T., Allahverdi, A., 2016. Improving educational objectives of the industrial and management systems engineering program at Kuwait University. European Journal of Engineering Education 41, 252-262.

9. Allahverdi, A., 2015. A unique and effective way of teaching a capstone/senior design course. Global Journal of Engineering Education 17, 132-137.

10. Allahverdi, A., Aldowaisan, T., 2015. Assessment of student outcomes of the industrial and management systems engineering program at Kuwait University. Global Journal of Engineering Education 17, 103-112.

11. Allahverdi, A., 2015. The third comprehensive survey on scheduling problems with setup times/costs. European Journal of Operational Research 246, 345-378.

12. Alsabah, H., Aldaihani, M., Allahverdi, A., 2015. Assigning patients to rooms in a private hospital in Kuwait. International Journal of Services and Operations Management 22, 304- 322.

13. Aydilek, A., Aydilek, H., Allahverdi, A., 2015. Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan. International Journal of Production Research 53, 2803-2819.

14. Allahverdi, A., Aydilek, H., 2015. The two stage assembly flowshop scheduling problem to minimize total tardiness. Journal of Intelligent Manufacturing 26, 225-237.

15. Aldowaisan, T., Allahverdi, A., 2015. Total tardiness performance in m-machine no-wait flowshops with separate setup times. Intelligent Control and Automation 6, 38-44.

16. Allahverdi, A., Aydilek, H., Aydilek, A., 2014. Single machine scheduling problem with interval processing times to minimize mean weighted completion time. Computers and Operations Research 51, 200-207.

17. Allahverdi, A., Aydilek, H., 2014. Total completion time with makespan constraint in nowait flowshops with setup times. European Journal of Operational Research 238, 724-734.

18. Allahverdi, A., Aydilek, H., 2013. Algorithms for No-wait flowshops with total completion time subject to makespan. International Journal of Advanced Manufacturing Technology 68, 2237-2251.

19. Aydilek, H., Allahverdi, A., 2013. A polynomial time heuristic for flowshop scheduling with setup times and random processing times. Applied Mathematical Modeling 37, 7164- 7173.

20. Aydilek, H., Allahverdi, A., 2013. New heuristics for no-wait flowshops with performance measures of makespan and mean completion time. International Journal of Operations Research 10, 29-37.

21. Al-Anzi, F., Allahverdi, A., 2013. An artificial immune system heuristic for two-stage multi-machine assembly scheduling problem to minimize total completion time. Journal of Manufacturing Systems 32, 825-830.

22. Aydilek, A., Aydilek, H., Allahverdi, A., 2013. Increasing the profitability and competitiveness in a production environment with random and bounded setup times. International Journal of Production Research 51, 106-117.

23. Aldowaisan, T., Allahverdi, A., 2012. Minimizing total tardiness in no-wait flowshops. Foundations of Computing and Decision Sciences 37, 149-162.

24. Aydilek, H., Allahverdi, A., 2012. Heuristics for no-wait flowshops with makespan subject to mean completion time. Applied Mathematics and Computation 219, 351-359.

25. Al-Anzi, F., Allahverdi, A., 2012. Better heuristics for a two-stage multi-machine assembly scheduling problem to minimize total completion time. International Journal of Operations Research 9, 66-75.

26. Aldowaisan, T., Allahverdi, A., 2012. No-wait flowshop scheduling problem to minimize the number of tardy jobs. International Journal of Advanced Manufacturing Technology 61, 311-323.

27. Ladhari, T., Msakni, M.K., Allahverdi, A., 2012. Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times. Journal of the Operational Research Society 63, 445-459.

28. Allahverdi, A., Aydilek, H., 2010. Heuristics for two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times. Computers and Mathematics with Applications 60, 1374-1384.

29. Al-Anzi, A., Al-Zamel, K., Allahverdi, A., 2010. Weighted multi-skill resources project scheduling. Journal of Software Engineering and Applications 3, 1125-1130.

30. Allahverdi, A., and Aydilek, H., 2010. Heuristics for two-machine flowshop scheduling problem to minimize makespan with bounded processing times. International Journal of Production Research 48, 6367- 6385.

31. Aydilek, H., and Allahverdi, A., 2010. Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time. Computers and Mathematics with Applications 59, 684-693.

32. Fondrevelle, J., Oulamara, A., Portmann, M.C., Allahverdi, A., 2009. Permutation flowshops with exact time lags to minimize maximum lateness. International Journal of Production Research 47, 6759-6775.

33. Ruiz, R., Allahverdi, A., 2009. New heuristics for no-wait flowshops with a linear combination of makespan and maximum lateness. International Journal of Production Research 47, 5717-5738.

34. Abdulmalek, F., and Allahverdi, A., 2009. Optimizing a help desk performance at a telecommunication company”. International Journal of Engineering Systems Modellingand Simulation 1, 160-164.

35. Allahverdi, A., Al-Anzi, F.S., 2009. The two-stage assembly scheduling problem to minimize total completion time with setup times. Computers and Operations Research 36, 2740-2747.

36. Al-Anzi, F.S., Allahverdi, A., 2009. Heuristics for a Two-Stage Assembly Flowshop with Bicriteria of Maximum Lateness and Makespan. Computers and Operations Research 36, 2682-2689.

37. Ruiz, R., Allahverdi, A., 2009. Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness. Computers and Operations Research 36, 1268-1283.

38. Allahverdi, A., 2009. Three-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times. Journal of Operations and Logistics 2, 1-11.

39. Allahverdi, A., Al-Anzi, F.S., 2008. The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time. International Journal of Advanced Manufacturing Technology 37, 166-177.

40. Savsar, M., Allahverdi, A., 2008. Senior design course in industrial engineering at Kuwait University. Int. J. Continuing Engineering Education and Life-Long Learning 18, 253-263.

41. Allahverdi, A., 2008. Three-machine flowshop scheduling problem to minimize makespan with bounded setup and processing times. Journal of the Chinese Institute of Industrial Engineers 25, 52-61.

42. Allahverdi, A., Ng, C.T., Cheng, T.C.E., and Kovalyov, M.Y., 2008. A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187, 985- 1032.

43. Allahverdi, A., Soroush, H.M., 2008. The significance of reducing setup times/setup costs. European Journal of Operational Research 187, 978-984.

44. Allahverdi, A., 2007. Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times. Decision Making in Manufacturing and Services 1, 5-23. 45.

Ruiz, R., and Allahverdi, A., 2007. No-wait flowshop with separate setup times to minimize maximum lateness. International Journal of Advanced Manufacturing Technology 35, 551- 565.

46. Ruiz, R., and Allahverdi, A., 2007. Some effective heuristics for no-wait flowshops with setup times to minimize total completion time. Annals of Operations Research 156, 143- 171.

47. Al-Anzi, F., Allahverdi, A., and Kovalyov, M.Y., 2007. Batch deteriorating items with applications in computer communication and reverse logistics. European Journal of Operational Research 182, 1002-1011.

48. Al-Anzi, F., and Allahverdi, A., 2007. A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. European Journal of Operational Research 182, 80-94.

49. Ng, C.T., Allahverdi, A., Al-Anzi, F., Cheng, T.C.E., 2007. The three-machine flowshop scheduling problem to minimize maximum lateness with separate setup times. International Journal of Operational Research 2, 135-155.

50. Allahverdi, A., 2006. Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times. Kuwait Journal of Science and Engineering 33, 233-251.

51. Al-Anzi, F., Sotskov, Y.N., Allahverdi, A., Andreev, G., 2006. Using mixed graph coloring to minimize total completion time in job shop scheduling. Applied Mathematics and Computation 182, 1137-1148.

52. Allahverdi, A., and Al-Anzi, F., 2006. Evolutionary heuristics and an algorithm for the twostage assembly scheduling problem to minimize makespan with setup times. International Journal of Production Research 44, 4713-4735.

53. Al-Anzi, F., and Allahverdi, A., 2006. A hybrid tabu search heuristic for the two-stage assembly scheduling problem. International Journal of Operations Research 3, 109-119.

54. Al-Anzi, F., and Allahverdi, A., 2006. Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm. International Journal of Production Research 44, 4701-4712.

55. Allahverdi, A., 2006. Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times. International Journal of Production Economics 103, 386-400.

56. Zeydan, M., and Allahverdi, A., 2006. Economic order quantity with uncertain inflation: A case study.International Journal of Industrial Engineering: Theory Applications and Practice 13, 321-328.

57. Allahverdi, A., and Al-Anzi, F., 2006. Scheduling multi-stage parallel-processor internet services to minimize average response time. Journal of the Operational Research Society 57, 101-110.

58. Allahverdi, A., and Al-Anzi, F., 2006. A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times. European Journal of Operational Research 169, 767-780.

59. Allahverdi, A., and Al-Anzi, F., 2006. A PSO and a tabu search heuristics for assembly scheduling problem of the two-stage distributed database application. Computers and Operations Research 33, 1056-1080.

60. Allahverdi, A., 2005. Two-machine flowshop scheduling problem to minimize makespan with bounded setup and processing times. International Journal of Agile Manufacturing 8, 145-153.

61. Al-Anzi, F. and Allahverdi, A., 2005. Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests. Journal of Mathematical Modelling and Algorithms 4, 435-453.

62. Allahverdi, A., 2005. Three-machine flowshop scheduling to minimize maximum lateness. International Journal of Agile Manufacturing 8, 155-163.

63. Allahverdi, A., Al-Anzi, F., and Gupta, J.N.D., 2005. A polynomial genetic based algorithm to minimize maximum lateness in a two-stage flowshop with setup times. International Journal of Operations Research 2, 89-100.

64. Fondrevelle, J., Allahverdi, A., and Oulamara, A., 2005. Two-machine no-wait flowshop scheduling problem to minimize maximum lateness with separate setup and removal times. International Journal of Agile Manufacturing 8, 165-174.

65. Soroush, H.M,. and Allahverdi, A., 2005. Stochastic two-machine flowshop scheduling problem with total completion time criterion. International Journal of Industrial Engineering: Theory Applications and Practice 12, 159-171.

66. Allahverdi, A., 2004. Stochastically minimizing makespan on a three-machine flowshop. International Journal of Industrial Engineering: Theory Applications and Practice 11, 124- 131.

67. Aldowaisan, T., and Allahverdi, A., 2004. Three-machine no-wait flowshop with separate setup and removal times to minimize total completion time. International Journal of Industrial Engineering: Theory Applications and Practice 11, 113-123.

68. Al-Anzi, F. and Allahverdi, A., 2004. A hybrid simulated annealing heuristic for multimedia object requests scheduling problem. International Journal of Computers and Applications 26, 207-212.

69. Yeh, W.C., and Allahverdi, A., 2004. A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan and total flowtime” International Transactions in Operational Research 11, 341-359.

70. Aldowaisan, T., and Allahverdi, A., 2004. A new heuristic for m-machine no-wait flowshop to minimize total completion time. OMEGA The International Journal of Management Sciences 32, 345-352.

71. Sotskov, Y.N., Allahverdi, A., and Lai, T.C., 2004. Flowshop scheduling problem to minimize total completion time with random and bounded processing times. Journal of Operational Research Society 55, 277-286.

72. Allahverdi, A., 2004. A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Computers & Operations Research 31, 157- 180.

73. Allahverdi, A., Aldowaisan, T., 2004. No-wait flowshops with bicriteria of makespan and maximum lateness. European Journal of Operational Research 152, 132-147.

74. Allahverdi, A., Aldowaisan, T., and Sotskov, Y.N., 2003. Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times. International Journal of Mathematics and Mathematical Sciences 39, 2475-2486.

75. Yigit, A., and Allahverdi, A., 2003. Product design in reconfigurable manufacturing systems”, International Journal of Production Research 41, 4063-4074.

76. Allahverdi, A., and Sotskov, Y.N., 2003. Two-machine flowshop minimum length scheduling problem with random and bounded processing times. International Transactions in Operational Research 10, 65-76.

77. Allahverdi, A., 2003. The two and m machines flowshop scheduling problems with bicriteria of makespan and mean flowtime. European Journal of Operational Research 147, 373 - 396.

78. Aldowaisan, T., and Allahverdi, A., 2003. New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research 30, 1219-1231.

79. Allahverdi, A., Aldowaisan, T., 2002. No-wait flowshops with bicriteria of makespan and total completion time. Journal of the Operational Research Society 53, 1004-1015.

80. Allahverdi, A., Aldowaisan, T., 2002. Two-machine flowshop to minimize total completion time with separated setup and removal times. International Journal of Industrial Engineering: Theory Applications and Practice 9, 275-286.

81. Al-Anzi, F. and Allahverdi, A., 2002. Flexible multi-stage parallel-server scheduling for Internet service architecture. International Journal of Parallel and Distributed Systems and Networks 5, 134-142.

82. Allahverdi, A. and Savsar, M., 2002. Scheduling on three-serial duplicate stations in assembly lines with multiple criteria. International Journal of Industrial Engineering: Theory Applications and Practice 9, 265-274.

83. Yigit, A.S., Ulsoy, A.G., and Allahverdi, A., 2002. Optimizing modular product design for reconfigurable manufacturing. Journal of Intelligent Manufacturing 13, 309-316.

84. Allahverdi, A., Aldowaisan, T., 2002. New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics 77, 71-83.

85. Allahverdi, A. and Al-Anzi, F., 2002. Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications. Computers and Operations Research 29, 971-994.

86. Allahverdi, A., 2001. The tricriteria two-machine flowshop scheduling problem. International Transactions in Operational Research 8, 403-425.

87. Al-Anzi, F. and Allahverdi, A., 2001. The relationship between three-tiered client-server internet database connectivity and two-machine flowshop. International Journal of Parallel and Distributed Systems and Networks 4, 94-101.

88. Allahverdi, A., Aldowaisan, T., 2001. Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times. Journal of the Operational Research Society 52, 449-462.

89. Allahverdi, A., Savsar, M., 2001. Stochastic Proportionate flowshop scheduling with setups. Computers & Industrial Engineering 39, 357-369.

90. Allahverdi, A., Aldowaisan, T., 2000. No-wait and separate setup three-machine flowshop with total completion time criterion. International Transactions in Operational Research 7, 245-264.

91. Allahverdi, A., 2000. Minimizing mean flowtime in a two-machine flowshop with sequence independent setup times. Computers & Operations Research 27, 111-127.

92. Savsar, M., and Allahverdi, A., 1999. Algorithms for scheduling of jobs on two serial duplicate stations. International Transactions in Operational Research 6, 411-422.

93. Allahverdi, A., Gupta, J.N.D., and Aldowaisan, T., 1999. A review of scheduling research involving setup considerations. OMEGA The International Journal of Management Sciences 27, 219-239.

94. Allahverdi, A., 1999. Stochastically minimizing total flowtime in flowshops with no waiting space. European Journal of Operational Research 113, 101-112.

95. Allahverdi, A., and Aldowaisan, T., 1998. Job lateness in flowshops with setup and removal times separated. Journal of the Operational Research Society 49, 1001-1006.

96. Allahverdi, A., and Mittenthal, J., 1998. Dual criteria scheduling on a two-machine flowshop subject to random breakdowns. International Transactions in Operational Research 5, 317-324.

97. Aldowaisan, T., and Allahverdi, A., 1998. Total flowtime in no-wait flowshops with separated setup times. Computers & Operations Research 25, 757-765.

98. Allahverdi, A., and Tatari, M.F., 1997. Stochastic machine dominance in flowshops. Computers and Industrial Engineering 32, 735 - 741.

99. Allahverdi, A., 1997. Scheduling in stochastic flowshops with independent setup, processing, and removal times. Computers & Operations Research 24, 955-960. 100. Allahverdi, A., 1996. Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computers & Operations Research 23, 909-916.

101. Allahverdi, A., and Tatari, M.F., 1996. Simulation of different rules in stochastic scheduling. Computers and Industrial Engineering 31, 209-212.

102. Allahverdi, A., 1995. Two-stage production scheduling with separated setup times and stochastic breakdowns. Journal of the Operational Research Society 46, 896-904.

103. Allahverdi, A., and Mittenthal, J., 1995. Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function. European Journal of Operational Research 81, 376-387.

104. Allahverdi, A., 1994. Optimal policies for a deterministic two-machine semi-ordered flowshop with maximum lateness objective. Transactions on Operational Research 6, 47- 54.

105. Allahverdi, A., and Mittenthal, J., 1994. Scheduling on m parallel machines subject to random breakdowns to minimize expected mean flowtime. Naval Research Logistics 41, 677-682.

106. Allahverdi, A., and Mittenthal, J., 1994. Two-machine ordered flowshop scheduling under random breakdowns. Mathematical and Computer Modeling 20, 9-17.

107. Willemain, T., Allahverdi, A., and et al. 1992. Robust estimation methods for exponential data: A monte-carlo comparison. Communications in Statistics: Simulation and Computation 21, 1043-1075.