IEEE Transactions on Cybernetics · 2021 · 57 citations · 32 references
EngineeringIndustrial EngineeringManufacturing EngineeringManufacturing SystemsOptimizationProduction PlanningCombinatorial OptimizationInteger ProgrammingManufacturing ConstraintsMulti-objective OptimizationMultiobjective OptimizationProduction SchedulingInteractive Multiobjective OptimizationManufacturingMultiobjective Decision MakingMultiobjective Integer ProgrammingMultiobjective Optimization FormulationOptimization-based Decision MakingOrder Fulfillment OptimizationSingle-objective Optimization
This work is geared toward a real-world manufacturing planning (MP) task, whose two objectives are to maximize the order fulfillment rate and minimize the total cost. More important, the requirements and constraints in real manufacturing make the MP task very challenging in several aspects. For example, the MP needs to cover many production components of multiple plants over a 30-day horizon, which means that it involves a large number of decision variables. Furthermore, the MP task's two objectives have extremely different magnitudes, and some constraints are difficult to handle. Facing these uncompromising practical requirements, we introduce an interactive multiobjective optimization-based MP system in this article. It can help the decision maker reach a satisfactory tradeoff between the two objectives without consuming massive calculations. In the MP system, the submitted MP task is modeled as a multiobjective integer programming (MOIP) problem. Then, the MOIP problem is addressed via a two-stage multiobjective optimization algorithm (TSMOA). To alleviate the heavy calculation burden, TSMOA transforms the optimization of the MOIP problem into the optimization of a series of single-objective problems (SOPs). Meanwhile, a new SOP solving strategy is used in the MP system to further reduce the computational cost. It utilizes two sequential easier SOPs as the approximator of the original complex SOP for optimization. As part of the MP system, TSMOA and the SOP solving strategy are demonstrated to be efficient in real-world MP applications. In addition, the effectiveness of TSMOA is also validated on benchmark problems. The results indicate that TSMOA as well as the MP system are promising.
32
A Simplex Method for Function Minimization
J. A. Nelder, R. Mead · The Computer Journal · 1965 · 28.9K citations
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations
Sequential Quadratic Programming
Paul T. Boggs, Jon W. Tolle · Acta Numerica · 1995 · 1.8K citations