Processing, Please wait...

  • Publisher Home
  • Home
  • 🔙 Back
  • 📚 Journals
    • ⚙️ IJIEC - Industrial Engineering Computations
    • 🌐 IJDNS - Data and Network Science
    • 🧪 CCL - Current Chemistry Letters
    • 💹 AC - Accounting
    • 🎯 DSL - Decision Science Letters
    • 🚛 USCM - Uncertain Supply Chain Management
    • 🏗️ JPM - Journal of Project Management
    • 🏥 HE - Healthcare Engineering
    • 📈 SCI - Scientometrica
    • 🔩 ESM - Engineering Solid Mechanics
    • 🌿 JFS - Journal of Future Sustainability
    • 💼 MSL - Management Science Letters
  • 📝 Submit Article
  • 📊 Statistics
  • 📋 About
    • 📄 About Us
    • 📰 Blog
    • 📢 News
    • 📧 Contact
  • 📺 Tutorial
  • Search:
  • Advanced Search

Growing Science » Tags cloud » Sample Average Approximation

⭐ Highly Cited Articles

  • Jaya Algorithm
  • Rao Algorithm
  • TLBO Algorithm
  • ChatGPT and Blended Learning

Journals

  • IJIEC (840)
  • IJDS (1032)
  • DSL (759)
  • ESM (434)
  • CCL (563)
  • JPM (350)
  • AC (572)
  • JFS (106)
  • MSL (2658)
  • USCM (1104)
  • HE (56)
  • SCI (53)

🔑 Keywords

Jordan(175)
Supply chain management(172)
Vietnam(154)
Customer satisfaction(124)
Performance(117)
Supply chain(115)
Artificial intelligence(108)
Service quality(101)
Competitive advantage(100)
SMEs(95)
Tehran Stock Exchange(94)
Sustainability(94)
optimization(88)
Financial performance(86)
TOPSIS(85)
Trust(85)
Organizational performance(81)
Job satisfaction(81)
Genetic Algorithm(81)
Social media(80)


» Show all keywords

✍️ Authors

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


» Show all authors

🌍 Countries

1. Algeria (52)
2. Angola (2)
3. Argentina (22)
4. Armenia (2)
5. Australia (52)
6. Austria (2)
7. Bahrain (26)
8. Bangladesh (58)
9. Belarus (4)
10. Belgium (3)
11. Benin (2)
12. Benin Republic (1)
13. Bhutan (1)
14. Bosnia and Herzegovina (1)
15. Botswana (9)
16. Brazil (40)
17. Brunei (1)
18. Bulgaria (1)
19. Burkina Faso (1)
20. Cameroon (1)
Total: 121 countries

Show all countries
Sort articles by: 📖 Volume | 📅 Date | ⭐ Most Rates | 👁️ Most Views | 🚀 Rising Stars | 🔗 Citations (Scopus) | 🔥 Hot Papers
1.

A two-stage stochastic model for picker allocation problem in warehouses considering the rest allowance and picker’s weight Pages 685-704 PDF Download PDF

Authors: Elif Elçin Günay

doi 10.5267/j.ijiec.2024.5.001

🔑 Keywords: Order picking, Energy expenditure, Fatigue, Picker assignment problem, Stochastic programming, Sample average approximation

Abstract:
Order picking (OP) is a critical yet time-consuming and labor-intensive warehouse operation within the supply chain. In picker-to-part systems with high demand, pickers are exposed to fatigue due to the excessive repetition of picking activities, which results in high human energy expenditure. The literature indicates that energy expenditure depends on the picking activity and the worker’s attributes, such as pickers’ weight, gender, and age. Studies have shown that as the weights of individuals increase, the energy consumed for the same task increases. This study proposes a two-stage stochastic programming model that minimizes assignment and overtime costs while avoiding excessive fatigue levels for pickers by incorporating rest allowance into the picking tour time. In the first stage, the number of pickers required is decided. In the second stage, orders are assigned to pickers considering uncertain energy expenditure. The two-stage stochastic programming model is solved by the sample average approximation algorithm. Results show that both OP cost and the number of pickers required to fulfill an order increase when the picker’s weight exceeds 80kg. In allocating orders, pickers weighing less than 80kg should be assigned to orders with more items, such as those containing 4- or 5-items. Conversely, pickers weighing more than 80kg should be assigned to orders with fewer items, like those containing 2- or 3-items, to avoid fatigue side effects.
Details
  • 17
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: IJIEC | Year: 2024 | Volume: 15 | Issue: 3 | Views: 2120

 
2.

A mathematical model for the product mixing and lot-sizing problem by considering stochastic demand Pages 237-250 PDF Download PDF

Authors: Dionicio Neira Rodado, John Willmer Escobar, Rafael Guillermo García-Cáceres, Fabricio Andrés Niebles Atencio

doi 10.5267/j.ijiec.2016.9.003

🔑 Keywords: Lot Sizing, Product-mix planning, Stochastic demand, EVA, Sample Average Approximation

Abstract:
The product-mix planning and the lot size decisions are some of the most fundamental research themes for the operations research community. The fact that markets have become more unpredictable has increaed the importance of these issues, rapidly. Currently, directors need to work with product-mix planning and lot size decision models by introducing stochastic variables related to the demands, lead times, etc. However, some real mathematical models involving stochastic variables are not capable of obtaining good solutions within short commuting times. Several heuristics and metaheuristics have been developed to deal with lot decisions problems, in order to obtain high quality results within short commuting times. Nevertheless, the search for an efficient model by considering product mix and deal size with stochastic demand is a prominent research area. This paper aims to develop a general model for the product-mix, and lot size decision within a stochastic demand environment, by introducing the Economic Value Added (EVA) as the objective function of a product portfolio selection. The proposed stochastic model has been solved by using a Sample Average Approximation (SAA) scheme. The proposed model obtains high quality results within acceptable computing times.
Details
  • 34
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: IJIEC | Year: 2017 | Volume: 8 | Issue: 2 | Views: 2895

 
3.

Redesign of a supply network by considering stochastic demand Pages 521-528 PDF Download PDF

Authors: Juan Camilo Paz, Julián Andrés Orozco, Jaime Mauricio Salinas, Nicolás Clavijo Buriticá, John Willmer Escobar

doi 10.5267/j.ijiec.2015.5.001

🔑 Keywords: Logistics, Sample Average Approximation, Stochastic Linear Programming, Supply Network Design, Variability of the Demand

Abstract:
This paper presents the problem of redesigning a supply network of large scale by considering variability of the demand. The central problematic takes root in determining strategic decisions of closing and adjusting of capacity of some network echelons and the tactical decisions concerning to the distribution channels used for transporting products. We have formulated a deterministic Mixed Integer Linear Programming Model (MILP) and a stochastic MILP model (SMILP) whose objective functions are the maximization of the EBITDA (Earnings before Interest, Taxes, Depreciation and Amortization). The decisions of Network Design on stochastic model as capacities, number of warehouses in operation, material and product flows between echelons, are determined in a single stage by defining an objective function that penalizes unsatisfied demand and surplus of demand due to demand changes. The solution strategy adopted for the stochastic model is a scheme denominated as Sample Average Approximation (SAA). The model is based on the case of a Colombian company dedicated to production and marketing of foodstuffs and supplies for the bakery industry. The results show that the proposed methodology was a solid reference for decision support regarding to the supply networks redesign by considering the expected economic contribution of products and variability of the demand.
Details
  • 0
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: IJIEC | Year: 2015 | Volume: 6 | Issue: 4 | Views: 2546

 

® 2010-2026 GrowingScience.Com