TY - JOUR
T1 - Solving Aggregate Production Planning Problems
T2 - An Extended TOPSIS Approach
AU - Yu, Vincent F.
AU - Kao, Hsuan Chih
AU - Chiang, Fu Yuan
AU - Lin, Shih Wei
N1 - Publisher Copyright:
© 2022 by the authors.
PY - 2022/7
Y1 - 2022/7
N2 - Aggregate production planning (APP) was developed for solving the problem of determining production, inventory, and workforce levels to meet fluctuating demand requirements over a planning horizon. In this work, multiple objectives were considered to determine the most effective means of satisfying forecasted demand by adjusting production rates, hiring and layoffs, inventory levels, overtime work, back orders, and other controllable variables. An extended technique for order preference via the similarity ideal solution (TOPSIS) approach was developed. It was formulated to solve this complicated, multi-objective APP decision problem. Compromise (ideal solution) control minimized the measure of distance, providing which of the closest solutions has the shortest distance from a positive ideal solution (PIS) and the longest distance from a negative ideal solution (NIS). The proposed method can transform multiple objectives into two objectives. The bi-objective problem can then be solved by balancing satisfaction using a max–min operator for resolving the conflict between the new criteria based on PIS and NIS. Finally, an application example demonstrated the proposed model’s applicability to practical APP decision problems.
AB - Aggregate production planning (APP) was developed for solving the problem of determining production, inventory, and workforce levels to meet fluctuating demand requirements over a planning horizon. In this work, multiple objectives were considered to determine the most effective means of satisfying forecasted demand by adjusting production rates, hiring and layoffs, inventory levels, overtime work, back orders, and other controllable variables. An extended technique for order preference via the similarity ideal solution (TOPSIS) approach was developed. It was formulated to solve this complicated, multi-objective APP decision problem. Compromise (ideal solution) control minimized the measure of distance, providing which of the closest solutions has the shortest distance from a positive ideal solution (PIS) and the longest distance from a negative ideal solution (NIS). The proposed method can transform multiple objectives into two objectives. The bi-objective problem can then be solved by balancing satisfaction using a max–min operator for resolving the conflict between the new criteria based on PIS and NIS. Finally, an application example demonstrated the proposed model’s applicability to practical APP decision problems.
KW - TOPSIS
KW - aggregate production planning
KW - compromise programming
KW - multicriteria decision-making
UR - https://www.scopus.com/pages/publications/85135055230
U2 - 10.3390/app12146945
DO - 10.3390/app12146945
M3 - 文章
AN - SCOPUS:85135055230
SN - 2076-3417
VL - 12
JO - Applied Sciences (Switzerland)
JF - Applied Sciences (Switzerland)
IS - 14
M1 - 6945
ER -