Login / Signup
G. M. Komaki
Publication Activity (10 Years)
Years Active: 2013-2019
Publications (10 Years): 7
Top Topics
Scheduling Problem
Processing Times
Optimization Algorithm
Flowshop
Top Venues
Comput. Ind. Eng.
IEEE BigData
Comput. Oper. Res.
Int. J. Prod. Res.
</>
Publications
</>
G. M. Komaki
,
Shaya Sheikh
,
Behnam Malakooti
Flow shop scheduling problems with assembly operations: a review and new trends.
Int. J. Prod. Res.
57 (10) (2019)
Vahid Kayvanfar
,
Shaya Sheikh
,
G. M. Komaki
An Intelligent Water Drops Algorithm to Supply-Demand Hub in Industrial Cluster Considering Transportation Mode.
IEEE BigData
(2018)
Shaya Sheikh
,
G. M. Komaki
,
Vahid Kayvanfar
Multi objective two-stage assembly flow shop with release time.
Comput. Ind. Eng.
124 (2018)
G. M. Komaki
,
Ehsan Teymourian
,
Vahid Kayvanfar
,
Zahra Booyavi
Improved discrete cuckoo optimization algorithm for the three-stage assembly flowshop scheduling problem.
Comput. Ind. Eng.
105 (2017)
Ehsan Teymourian
,
Vahid Kayvanfar
,
G. M. Komaki
,
Mostafa Zandieh
Enhanced intelligent water drops and cuckoo search algorithms for solving the capacitated vehicle routing problem.
Inf. Sci.
(2016)
Ehsan Teymourian
,
Vahid Kayvanfar
,
G. M. Komaki
,
Majtaba Khodarahmi
An Enhanced Intelligent Water Drops Algorithm for Scheduling of an Agile Manufacturing System.
Int. J. Inf. Technol. Decis. Mak.
15 (2) (2016)
G. M. Komaki
,
Vahid Kayvanfar
Grey Wolf Optimizer algorithm for the two-stage assembly flow shop scheduling problem with release time.
J. Comput. Sci.
8 (2015)
Zahra Booyavi
,
Ehsan Teymourian
,
G. M. Komaki
,
Shaya Sheikh
An improved optimization method based on the intelligent water drops algorithm for the vehicle routing problem.
CIPLS
(2014)
Vahid Kayvanfar
,
G. M. Komaki
,
Amin Aalaei
,
Mostafa Zandieh
Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times.
Comput. Oper. Res.
41 (2014)
Vahid Kayvanfar
,
Iraj Mahdavi
,
G. M. Komaki
Single machine scheduling with controllable processing times to minimize total tardiness and earliness.
Comput. Ind. Eng.
65 (1) (2013)