“…Considering a multi-item dynamic lot sizing strategy with production and warehouse capacities with different storage allocation policies, a mathematical model of the related problem was detailed, and dominance properties were presented separately for each storage allocation policy [36]. Based on no-shortage policy, the proposed algorithm utilized transfer of lots between consecutive periods.…”
With the increasing influence of climate change, green development has become an important trend. Since manufacturing represents approximately one-half of total energy consumption, reducing the amount of energy consumed within this industry is imperative. This study provides a hybrid flow shop scheduling issue under a time-of-use and ladder electricity price system to reduce total energy consumption without compromising maximum completion time. An improved non-dominated sorting genetic algorithm II with some optimization strategies is proposed to solve the problem. First, an enhanced constructive heuristic algorithm is used to improve the quantity of initial solution in the initialization. Besides, an adaptive genetic operation is introduced, aiming to avoid the emergence of locally optimal solutions. In addition, the right-shift approach is developed to reduce the total energy consumption without affecting completion time. By maintaining the production efficiency and reducing the energy consumption cost by 4.33%. A trade-off proposal is made between productivity and sustainability in view of the calculation results.
“…Considering a multi-item dynamic lot sizing strategy with production and warehouse capacities with different storage allocation policies, a mathematical model of the related problem was detailed, and dominance properties were presented separately for each storage allocation policy [36]. Based on no-shortage policy, the proposed algorithm utilized transfer of lots between consecutive periods.…”
With the increasing influence of climate change, green development has become an important trend. Since manufacturing represents approximately one-half of total energy consumption, reducing the amount of energy consumed within this industry is imperative. This study provides a hybrid flow shop scheduling issue under a time-of-use and ladder electricity price system to reduce total energy consumption without compromising maximum completion time. An improved non-dominated sorting genetic algorithm II with some optimization strategies is proposed to solve the problem. First, an enhanced constructive heuristic algorithm is used to improve the quantity of initial solution in the initialization. Besides, an adaptive genetic operation is introduced, aiming to avoid the emergence of locally optimal solutions. In addition, the right-shift approach is developed to reduce the total energy consumption without affecting completion time. By maintaining the production efficiency and reducing the energy consumption cost by 4.33%. A trade-off proposal is made between productivity and sustainability in view of the calculation results.
“…This study was motivated by a need of semiconductor company in Korea that produces memory chips and adopts make-to-order strategy. The order-lot matching problem is different from the lot sizing problem [1,2] in that lot sizes are not to be determined but fixed. Since order sizes are usually larger than lot sizes, an order is met with multiple lots.…”
Section: Introductionmentioning
confidence: 99%
“…Note that S(1, 2, 2) = {1}, S(4, 4, 2) = {4}, S(1, 4, 2) = {1, 4}, C({1, 2}, 0) = 30, and C({1, 4, 2}, 0) = 40. Since T(S(1, 4, 2), 0) ≥ 0, T(S(1,4,3), 0) = 10. Thus, we obtain T(S(1, 4, 0), 0) = 50 when an optimal order sequence is 1, 2, 4, 3.…”
Order-lot matching is the process of assigning items in lots being processed in the make-to-order production system to meet the due dates of the orders. In this study, an order-lot matching problem (OLMP) is considered to minimize the total tardiness of orders with different due dates. In the OLMP considered in this study, we need to not only determine the allocation of items to lots in the production facility but also generate a lot release plan for the given time horizon. We show that the OLMP can be considered as a special type of machine scheduling problem with many similarities to the single machine total tardiness scheduling problem ( 1 | | ∑ T i ). We suggest dominance conditions for the OLMP by modifying those for 1 | | ∑ T i and a dynamic programming (DP) model based on the dominance conditions. With two example problems, we show that the DP model can solve small-sized OLMPs optimally.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.