Processing, Please wait...

  • Home
  • About Us
  • Search:
  • Advanced Search

Growing Science » Authors » Jairo Rafael Montoya-Torres

Journals

  • IJIEC (777)
  • MSL (2643)
  • DSL (690)
  • CCL (528)
  • USCM (1092)
  • ESM (421)
  • AC (562)
  • JPM (293)
  • IJDS (952)
  • JFS (101)
  • HE (32)
  • SCI (26)

Keywords

Supply chain management(168)
Jordan(165)
Vietnam(151)
Customer satisfaction(120)
Performance(115)
Supply chain(112)
Service quality(98)
Competitive advantage(97)
Tehran Stock Exchange(94)
SMEs(89)
optimization(87)
Sustainability(86)
Artificial intelligence(85)
Financial performance(84)
Trust(83)
TOPSIS(83)
Job satisfaction(81)
Genetic Algorithm(78)
Factor analysis(78)
Social media(78)


» Show all keywords

Authors

Naser Azad(82)
Zeplin Jiwa Husada Tarigan(66)
Mohammad Reza Iravani(64)
Endri Endri(45)
Muhammad Alshurideh(42)
Hotlan Siagian(40)
Dmaithan Almajali(37)
Jumadil Saputra(36)
Muhammad Turki Alshurideh(35)
Ahmad Makui(33)
Barween Al Kurdi(32)
Hassan Ghodrati(31)
Basrowi Basrowi(31)
Sautma Ronni Basana(31)
Mohammad Khodaei Valahzaghard(30)
Shankar Chakraborty(29)
Ni Nyoman Kerti Yasa(29)
Haitham M. Alzoubi(28)
Sulieman Ibraheem Shelash Al-Hawary(28)
Prasadja Ricardianto(28)


» Show all authors

Countries

Iran(2192)
Indonesia(1311)
Jordan(813)
India(793)
Vietnam(510)
Saudi Arabia(478)
Malaysia(444)
China(231)
United Arab Emirates(226)
Thailand(160)
United States(114)
Ukraine(110)
Turkey(110)
Egypt(106)
Peru(94)
Canada(93)
Morocco(86)
Pakistan(85)
United Kingdom(80)
Nigeria(78)


» Show all countries
Sort articles by: Volume | Date | Most Rates | Most Views | Reviews | Alphabet
1.

The storage location assignment problem: A literature review Pages 199-224 Right click to download the paper Download PDF

Authors: Juan José Rojas Reyes, Elyn Lizeth Solano-Charris, Jairo Rafael Montoya-Torres

DOI: 10.5267/j.ijiec.2018.8.001

Keywords: Storage location assignment problem, Storage assignment, Warehouse management, Logistics, Solution methods, Literature Review

Abstract:
The storage of goods plays a crucial role in warehouse management systems. Although this operation is often considered simple, it is in fact complex, due to the volume of products, the uncertainty in demands, and the rapid customer service response that the market requires. Moreover, the optimization of logistical resources to maintain an efficient operational flow, such as the allocation of storage spaces, often requires complex decisions. In this paper, we analyze academic contributions on the storage location assignment problem published between 2005 and 2017. The literature is classified according to the solution methods, objectives, and related considerations. Suggestions are also provided for future research.
Details
  • 68
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: IJIEC | Year: 2019 | Volume: 10 | Issue: 2 | Views: 14179 | Reviews: 0

 
2.

A simheuristic for bi-objective stochastic permutation flow shop scheduling problem Pages 57-80 Right click to download the paper Download PDF

Authors: Eliana María González-Neira, Jairo Rafael Montoya-Torres

DOI: 10.5267/j.jpm.2019.1.003

Keywords: Stochastic permutation flow shop, Bi-objective, GRASP, Tardiness, Makespan

Abstract:
This paper addresses the stochastic permutation flow shop problem (SPFSP) in which the stochastic parameters are the processing times. This allows the modeling of setups and machine breakdowns. Likewise, it is proposed a multi-objective greedy randomized adaptive search procedure (GRASP) coupled with Monte-Carlo Simulation to obtain expected makespan and expected tardiness. To manage the bi-objective function, a sequential combined method is considered in the construction phase of the meta-heuristic. Moreover, the local Search combines 2-optimal interchanges with a Pareto Archived Evolution Strategy (PAES) to obtain the Pareto front. Also, some Taillard benchmark instances of deterministic permutation flow shop problem were adapted in order to include the variation in processing times. Accordingly, two coefficients of variation (CVs) were tested: one depending on expected processing times values defined as twice the expected processing time of a job, and a fixed value of 0.25. Thus, the computational results on benchmark instances show that the variable CV provided lower values of the expected makespan and tardiness, while the con-stant CV presented higher expected measures. The computational results present insights for further analysis on the behavior of stochastic scheduling problems for a better approach in real-life scenarios at industrial and service systems.
Details
  • 51
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: JPM | Year: 2019 | Volume: 4 | Issue: 2 | Views: 2033 | Reviews: 0

 

® 2010-2026 GrowingScience.Com