Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem
Tóm tắt
Từ khóa
Tài liệu tham khảo
Chan, 2006, Solving distributed FMS scheduling problems subject to maintenance: genetic algorithms approach, Robotics and Computer-Integrated Manufacturing, 22, 493, 10.1016/j.rcim.2005.11.005
Cui, 2015, An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems, Neurocomputing, 148, 248, 10.1016/j.neucom.2013.07.056
Deng, 2017, A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem, Swarm and Evolutionary Computing, 32, 121, 10.1016/j.swevo.2016.06.002
Ding, 2016, Data-Based Multiobjective Plant-Wide Performance Optimization of Industrial Processes Under Dynamic Environments, IEEE Transactions On Industrial Informatics, 12, 454, 10.1109/TII.2016.2516973
Dong, 2009, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, Computers & Operations Research, 36, 1664, 10.1016/j.cor.2008.04.001
Fernandez-Viagas, 2015, A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem, International Journal of Production Research, 53, 1111, 10.1080/00207543.2014.948578
Fernandez-Viagas, 2015, A new set of high-performing heuristics to minimize flowtime in permutation flowshops, Computers & Operations Research, 53, 68, 10.1016/j.cor.2014.08.004
Fernandez-Viagas, 2018, The distributed permutation flow shop to minimize the total flowtime, Computers & Industrial Engineering, 118, 464, 10.1016/j.cie.2018.03.014
Fernandez-Viagas, 2017, A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, European Journal of Operational Research, 257, 707, 10.1016/j.ejor.2016.09.055
Framinan, 2013
Fu, 2015, Global finite-time stabilization of a class of switched nonlinear systems with the powers of positive odd rational numbers, Automatica, 54, 360, 10.1016/j.automatica.2015.02.023
Gao, 2011, A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem, International Journal of Computational Intelligence Systems, 4, 497, 10.1080/18756891.2011.9727808
Gao, J., & Chen, R. (2011b). An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems. Technical Report SRE-10-1014. College of Information Science and Technology, Dalian Maritime University, Dalian, Liaoling Province, 116026, China.
Gao, 2013, An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem, International Journal of Production Research, 51, 641, 10.1080/00207543.2011.644819
Gao, 2012, Solving multi-factory flowshop problems with a novel variable neighbourhood descent algorithm, Journal of Computational Information Systems, 8, 2025
Giovanni, 2010, An improved genetic algorithm for the distributed and flexible job-shop scheduling problem, European Journal of Operational Research, 200, 395, 10.1016/j.ejor.2009.01.008
Glover, 2000, Fundamentals of scatter search and path relinking, Control and Cybernetics, 29, 652
Gong, 2018, A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems, Knowledge-Based Systems, 148, 115, 10.1016/j.knosys.2018.02.029
Gupta, 2006, Flowshop scheduling research after five decades, European Journal of Operational Research, 169, 699, 10.1016/j.ejor.2005.02.001
Jia, 2007, Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems, Computers & Industrial Engineering, 53, 313, 10.1016/j.cie.2007.06.024
Kalayci, 2015, Multi-objective fuzzy disassembly line balancing using a hybrid discrete artificial bee colony algorithm, Journal of Manufacturing Systems, 37, 672, 10.1016/j.jmsy.2014.11.015
Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization. Technical report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department.
Lei, 2017, Hybrid flow shop scheduling with assembly operations and key objectives: a novel neighborhood search, Applied Soft Computing, 61, 122, 10.1016/j.asoc.2017.07.058
Li, 2019, An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system, International Journal of Production Research, 10.1080/00207543.2019.1571687
Li, 2014, A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities, Applied Mathematical Modelling, 38, 1111, 10.1016/j.apm.2013.07.038
Lin, 2013, Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm, International Journal of Production Research, 51, 5029, 10.1080/00207543.2013.790571
Liu, 2010, A discrete electromagnetism-like mechanism algorithm for solving distributed permutation flowshop scheduling problem, 156
Liu, 2001, Constructive and composite heuristic solutions to the P//SCi scheduling problem, European Journal of Operational Research, 132, 439, 10.1016/S0377-2217(00)00137-5
Li, 2018, An Effective Multi-Objective Algorithm for Energy Efficient Scheduling in a Real-Life Welding Shop, IEEE Transactions on Industrial Informatics, 14, 5400, 10.1109/TII.2018.2843441
Lourenço, 2010, Iterated local search: framework and applications, vol. 1, 363
Naderi, 2010, The distributed permutation flowshop scheduling problem, Computers & Operations Research, 37, 754, 10.1016/j.cor.2009.06.019
Naderi, 2014, A scatter search algorithm for the distributed permutation flowshop scheduling problem, European Journal of Operational Research, 239, 323, 10.1016/j.ejor.2014.05.024
Naderi, 2010, Algorithms for a realistic variant of flowshop scheduling, Computers & Operations Research, 37, 236, 10.1016/j.cor.2009.04.017
Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA, 11, 91, 10.1016/0305-0483(83)90088-9
Pan, 2016, An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling, European Journal of Operational Research, 250, 702, 10.1016/j.ejor.2015.10.007
Pan, 2017, Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times, Applied Mathematics and Computation, 303, 89, 10.1016/j.amc.2017.01.004
Pan, 2012, An estimation of distribution algorithm for lot-streaming flow shop problems with setup times, OMEGA, 40, 166, 10.1016/j.omega.2011.05.002
Pan, 2012, Local search methods for the flowshop scheduling problem with flowtime minimization, European Journal of Operational Research, 222, 31, 10.1016/j.ejor.2012.04.034
Pan, 2013, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Computers & Operations Research, 40, 117, 10.1016/j.cor.2012.05.018
Pan, 2014, An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem, OMEGA, 44, 41, 10.1016/j.omega.2013.10.002
Pan, 2017, Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows, Computers & Operations Research, 80, 50, 10.1016/j.cor.2016.11.022
Pan, 2008, A discrete differential evolution algorithm for the permutation flowshop scheduling problem, Computers & Industrial Engineering, 55, 795, 10.1016/j.cie.2008.03.003
Pan, 2011, A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem, Information Sciences, 181, 2455, 10.1016/j.ins.2009.12.025
Pan, 2014, A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimization, OMEGA, 45, 42, 10.1016/j.omega.2013.12.004
Peng, 2019, A multi-start neighborhood descent algorithm for hybrid flowshop rescheduling, Swarm and Evoluationary Computation, 10.1016/j.swevo.2019.01.002
Rad, 2009, New high performing heuristics for minimizing makespan in permutation flowshops, OMEGA, 37, 331, 10.1016/j.omega.2007.02.002
Ruiz, 2019, Iterated Greedy methods for the distributed permutation flowshop scheduling problem, OMEGA, 83, 213, 10.1016/j.omega.2018.03.004
Ruiz, 2007, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, 177, 2033, 10.1016/j.ejor.2005.12.009
Ruiz, 2008, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, European Journal of Operational Research, 187, 1143, 10.1016/j.ejor.2006.07.029
Stützle, T. (1998)., Applying iterated local search to the permutation flow shop problem. Technical Report AIDA-98-04, FG Itellektik, FB Informatik, TU Darmstadt.
Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M
Tasgetiren, 2011, A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops, Information Sciences, 181, 3459, 10.1016/j.ins.2011.04.018
Tasgetiren, 2013, A. Oner, A Discrete Artificial Bee Colony Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with the Total Tardiness Criterion, Applied Mathematical Modeling, 37, 6758, 10.1016/j.apm.2013.02.011
Vallada, 2010, Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem, OMEGA, 3857
Wang, 2015, Single-machine scheduling problems with precedence constraints and simple linear deterioration, Applied Mathematical Modelling, 39, 1172, 10.1016/j.apm.2014.07.028
Wang, 2013, An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem, International Journal of Production Economics, 145, 387, 10.1016/j.ijpe.2013.05.004
Xu, 2014, An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem, Engeering Optimization, 46, 1269, 10.1080/0305215X.2013.827673