![]() ![]() J Intell Manuf 30(7):2587–2602įalih A, Shammari AZM (2020) Hybrid constrained permutation algorithm and genetic algorithm for process planning problem. Int J Prod Econ 53(1):101–116ĭou RL, Zhang YB, Nan GF (2019) Application of combined Kano model and interactive genetic algorithm for product customization. J Intell Manuf 28(6):1269–1283ĭaniel V, Guide R (1997) Scheduling with priority dispatching rules and drum-buffer-rope in a recoverable manufacturing system. Environ Sci Pollut Res 26(23):24162–24175Ĭosta A, Cappadonna FA, Fichera S (2017) A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent groupscheduling problem. Robot Cim-Int Manuf 71:102164Īlam I, Barua S, Ishii K, Mizutani S, Hossain MM, Rahman IMM, Hasegawa H (2019) Assessment of health risks associated with potentially toxic element contamination of soil by end-of-life ship dismantling in Bangladesh. The work can assist production managers in better planning a scheduling scheme for remanufacturing systems.Īderiani AR, Warmefjod K, Soderberg R (2021) Evaluating different strategies to achieve the highest geometric quality in self-adjusting smart assembly lines. Numerical experiments are conducted and the results verify the effectiveness of the scheduling model and proposed algorithm. Besides, an elite strategy is combined to gain a faster convergence speed. Crossover operation and mutation operation are specially designed subject to the characteristics of the optimization problem. The proposed IMGA adopts a hybrid initialization method to improve the solution quality and diversity at the beginning. To address this problem, a mathematical model is established and an improved genetic algorithm (IMGA) is proposed to solve it due to the problem complexity. Among various system configurations, we investigate a scheduling problem for the one with parallel disassembly workstations, several parallel flow-shop-type reprocessing lines and parallel reassembly workstations for the objective of minimize total energy consumption. At last, the reprocessed components are reassembled into new remanufactured products. ![]() This study regards a scheduling problem for remanufacturing systems where end-of-life (EOL) products are firstly disassembled into their constituent components, and next these components are reprocessed to like-new states. As one of the mainstream development directions of remanufacturing industry, remanufacturing system scheduling has become a hot research topic recently. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |