Skip to content

The code where the APP problem can be solved under uncertainty from the research article ""Multiproduct, multiperiod aggregate production planning subject to maximum inventory area and service level with demand uncertainty: A nearshoring context in Mexican companies" is posted in this repository

Notifications You must be signed in to change notification settings

JeGr9797/Aggregate-Production-Planning-Nearshoring

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

17 Commits
 
 
 
 

Repository files navigation

Aggregate-Production-Planning-Nearshoring

The code where the Aggregate Production Planning problem can be solved under uncertainty from the research article "Multiproduct, multiperiod aggregate production planning subject to maximum inventory area and service level with demand uncertainty: A nearshoring context in Mexican companies" is posted in this repository.

Gómez-Rocha, J. E., Hernández-Gress, E. S., & Santos-Borbolla, C. A. (2024). Improving aggregate production planning considering maximum inventory area and service level with demand uncertainty: a nearshoring context in Mexican companies. Journal of Industrial and Production Engineering, 41(5), 442–455. https://doi.org/10.1080/21681015.2024.2332632

The model is the following:

$min\sum_{s\in S}{p^s\sum_{k\in K}{W_k^sc_{W\left(k\right)}\left|T\right|}}\ \ +\sum_{s\in S}{p^s\sum_{t\in T}\sum_{k\in K}\left(U_{\left(t\right)k}^sc_{U\left(k\right)}+B_{\left(t\right)k}^sc_{B\left(k\right)}+I_{\left(t\right)k}^sc_{I\left(k\right)}\right)}+A_{req}^sc_{A_{req}}\ $

$U_{\left(t\right)k}^s+I_{\left(0\right)k}=d_{\left(t\right)k}^s+I_{\left(t\right)k}^s-B_{\left(t\right)k}^s\ \forall t=1,k\in K,s\in S\ $

$U_{\left(t\right)k}^s+I_{\left(t-1\right)k}^s=d_{\left(t\right)k}^s+I_{\left(t\right)k}^s-B_{\left(t\right)k}^s+B_{\left(t-1\right)k}^s\ \forall t=2,\ldots,T,k\in K,s\in S\ $

$U_{\left(t\right)k}^s \leq W_k^s{cp}_k\ \forall t\in T,k\in K,s\in S\ $

$\sum_{k\in K}{a_k\left(I_{\left(0\right)k}+U_{\left(t\right)k}^s\right)} \leq a_{max}+A_{req}^s\ \forall t=1,\ s\in S\ $

$\sum_{k\in K}{a_k\left(I_{\left(t-1\right)k}^s+U_{\left(t\right)k}^s\right)} \leq a_{max}+A_{req}^s\ \forall t=2,\ldots,T,\ s\in S\ $

$\frac{\sum_{t\in T}{(d_{\left(t\right)k}^s-B_{\left(t\right)k}^s)}}{\sum_{t\in T} d_{\left(t\right)k}^s}\geq{sl}_k\ \forall\ k\in K,s\in S\ $

$A_{req}^s=\sum_{s\in N_{s\left(t\right)}}{p^sA_{req}^s/p\left(n_{s\left(t\right)}\right)\ }\forall\ s\in S\ $

$W_k^s=\sum_{s\in N_{s\left(t\right)}}{p^sW_k^s/p\left(n_{s\left(t\right)}\right)\ }\forall\ k\in K,s\in S\ $

$U_{\left(t\right)k}^s=\sum_{s\in N_{s\left(t\right)}}{p^sU_{\left(t\right)k}^s/p\left(n_{s\left(t\right)}\right)\ }\forall t\in T,k\in K,s\in S\ $

$I_{\left(t\right)k}^s=\sum_{s\in N_{s\left(t\right)}}{p^sI_{\left(t\right)k}^s/p\left(n_{s\left(t\right)}\right)\ }\forall t\in T,k\in K,s\in S\ $

$S_{\left(t\right)k}^s=\sum_{s\in N_{s\left(t\right)}}{p^sS_{\left(t\right)k}^s/p\left(n_{s\left(t\right)}\right)\ }\forall t\in T,k\in K,s\in S\ $

$B_{\left(t\right)k}^s=\sum_{s\in N_{s\left(t\right)}}{p^sB_{\left(t\right)k}^s/p\left(n_{s\left(t\right)}\right)\ }\forall t\in T,k\in K,s\in S\ $

$A_{req}^s\geq0\ \forall\ s\in S\ $

$U_{\left(t\right)k}^s\geq0\ \forall t\in T,k\in K,s\in S\ $

$W_k^s,B_{\left(t\right)k}^s,I_{\left(t\right)k}^s\in\mathbb{Z}_+\ \forall t\in T,k\in K,s\in S\ $

About

The code where the APP problem can be solved under uncertainty from the research article ""Multiproduct, multiperiod aggregate production planning subject to maximum inventory area and service level with demand uncertainty: A nearshoring context in Mexican companies" is posted in this repository

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published