Author of the publication

An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports.

, , , , and . Comput. Ind. Eng., 56 (1): 241-248 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A New Capacitated Vehicle Routing Problem with Split Service for Minimizing Fleet Cost by Simulated Annealing., , , and . J. Frankl. Inst., 344 (5): 406-425 (2007)Optimization of a multi-modal tree hub location network with transportation energy consumption: A fuzzy approach., , , and . J. Intell. Fuzzy Syst., 30 (1): 43-60 (2016)An artificial bee colony algorithm for a two-stage hybrid flowshop scheduling problem with multilevel product structures and requirement operations., , and . Int. J. Comput. Integr. Manuf., 28 (5): 437-450 (2015)Designing a sustainable closed-loop pharmaceutical supply chain in a competitive market considering demand uncertainty, manufacturer's brand and waste management., , , , and . Ann. Oper. Res., 315 (2): 2057-2088 (2022)An integrative location-allocation model for humanitarian logistics with distributive injustice and dissatisfaction under uncertainty., , , and . Ann. Oper. Res., 319 (1): 211-257 (2022)A hybrid Z-number data envelopment analysis and neural network for assessment of supply chain resilience: a case study., , , and . Central Eur. J. Oper. Res., 29 (2): 611-631 (2021)Imperialistic Competitive Algorithm for Solving a Dynamic Cell Formation Problem with Production Planning., and . ICIC (1), volume 6215 of Lecture Notes in Computer Science, page 266-276. Springer, (2010)A New Hybrid Multi-objective Pareto Archive PSO Algorithm for a Classic Job Shop Scheduling Problem with Ready Times., , and . ICIC (3), volume 93 of Communications in Computer and Information Science, page 61-68. Springer, (2010)A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert., , , and . Appl. Math. Comput., 174 (1): 388-408 (2006)A multi-objective resource allocation problem in dynamic PERT networks., and . Appl. Math. Comput., 181 (1): 163-174 (2006)