Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
暂无分享,去创建一个
[1] Marcus Ritt,et al. An effective heuristic algorithm for the partial shop scheduling problem , 2018, Comput. Oper. Res..
[2] Nenad Mladenovic,et al. Variable Neighborhood Descent , 2018, Handbook of Heuristics.
[3] Ching-Jong Liao,et al. Scheduling with multi-attribute set-up times on unrelated parallel machines , 2016 .
[4] Ghaith Rabadi,et al. A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times , 2010, J. Intell. Manuf..
[5] Zhiwei Zhu,et al. Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach , 2000 .
[6] Chun-Lung Chen,et al. Iterated hybrid metaheuristic algorithms for unrelated parallel machines problem with unequal ready times and sequence-dependent setup times , 2012 .
[7] Patrick De Causmaecker,et al. A combined approach for analysing heuristic algorithms , 2018, J. Heuristics.
[8] José M. Valério de Carvalho,et al. A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times , 2007, Eur. J. Oper. Res..
[9] Nenad Mladenović,et al. Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations , 2018, INFORMS J. Comput..
[10] Chris N. Potts,et al. An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times , 2014 .
[11] Camino R. Vela,et al. An efficient memetic algorithm for total weighted tardiness minimization in a single machine with setups , 2015, Appl. Soft Comput..
[12] Shanlin Yang,et al. Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan , 2015, Eur. J. Oper. Res..
[13] Thatchai Thepphakorn,et al. An ant colony based timetabling tool , 2014 .
[14] Panos M. Pardalos,et al. Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent , 2020, Ann. Oper. Res..
[15] Yi Zhang,et al. A hybrid algorithm based on self-adaptive gravitational search algorithm and differential evolution , 2018, Expert Syst. Appl..
[16] Krzysztof Fleszar,et al. A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times , 2012, J. Intell. Manuf..
[17] Rasaratnam Logendran,et al. Scheduling unrelated parallel machines with sequence-dependent setups , 2007, Comput. Oper. Res..
[18] F. Frank Chen,et al. Unrelated parallel machine scheduling with setup times using simulated annealing , 2002 .
[19] Jae-Min Yu,et al. A tabu search algorithm for unrelated parallel machine scheduling with sequence- and machine-dependent setups: minimizing total tardiness , 2013 .
[20] Genichi Taguchi,et al. Introduction to quality engineering.... , 2014 .
[21] Sérgio Ricardo de Souza,et al. An immune-inspired algorithm for an unrelated parallel machines' scheduling problem with sequence and machine dependent setup-times for makespan minimisation , 2015, Neurocomputing.
[22] Panos M. Pardalos,et al. Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time , 2019, Ann. Oper. Res..
[23] Chi-Wei Lin,et al. Ant colony optimization for unrelated parallel machine scheduling , 2013 .
[24] Nenad Mladenovic,et al. Less is more: Basic variable neighborhood search for minimum differential dispersion problem , 2016, Inf. Sci..
[25] Robert Ivor John,et al. Good Laboratory Practice for optimization research , 2016, J. Oper. Res. Soc..
[26] Ghaith Rabadi,et al. A Tabu Search Algorithm to Minimize the Makespan for the Unrelated Parallel Machines Scheduling Problem with Setup Times , 2006 .
[27] Sérgio Ricardo de Souza,et al. A Variable Neighborhood Descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times , 2018, Electron. Notes Discret. Math..
[28] Fuqing Zhao,et al. A two-stage differential biogeography-based optimization algorithm and its performance analysis , 2019, Expert Syst. Appl..
[29] Marcone J. F. Souza,et al. Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties , 2017, Comput. Oper. Res..
[30] Fuqing Zhao,et al. A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem , 2019, Expert Syst. Appl..
[31] Panos M. Pardalos,et al. A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers , 2017, Omega.
[32] Fred W. Glover,et al. Neighborhood analysis: a case study on curriculum-based course timetabling , 2011, J. Heuristics.
[33] Erdal Caniyilmaz,et al. An artificial bee colony algorithm approach for unrelated parallel machine scheduling with processing set restrictions, job sequence-dependent setup times, and due date , 2015 .
[34] Xinguo Yu,et al. Adaptive Tabu search and variable neighborhood descent for packing unequal circles into a square , 2018, Appl. Soft Comput..
[35] Holger H. Hoos,et al. Analysing differences between algorithm configurations through ablation , 2015, Journal of Heuristics.
[36] Arthur Kramer,et al. A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems , 2015, J. Sched..
[37] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[38] Anand Subramanian,et al. Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times , 2015, Comput. Oper. Res..
[39] Helena Ramalhinho Dias Lourenço,et al. Iterated Local Search , 2001, Handbook of Metaheuristics.
[40] Yang-Kuei Lin,et al. Unrelated parallel machine scheduling with setup times and ready times , 2014 .
[41] Celso C. Ribeiro,et al. Probability Distribution of Solution Time in GRASP: An Experimental Investigation , 2002, J. Heuristics.
[42] Genichi Taguchi. System Of Experimental Design: Engineering Methods To Optimize Quality And Minimize Costs , 1987 .
[43] Rubén Ruiz,et al. Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times , 2011 .
[44] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[45] Marcus Ritt,et al. An iterated tabu search for the multi-compartment vehicle routing problem , 2017, Comput. Oper. Res..
[46] Pierre Hansen,et al. Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem , 2015, Int. Trans. Oper. Res..
[47] Javad Rezaeian,et al. Robust meta-heuristics implementation for unrelated parallel machines scheduling problem with rework processes and machine eligibility restrictions , 2014, Comput. Ind. Eng..
[48] Javad Rezaeian Zeidi,et al. Scheduling unrelated parallel machines with sequence-dependent setup times , 2015, The International Journal of Advanced Manufacturing Technology.
[49] Sérgio Ricardo de Souza,et al. A Clonal Selection Algorithm for Makespan Minimization on Unrelated Parallel Machines with Sequence Dependent Setup Times , 2013, 2013 Brazilian Conference on Intelligent Systems.
[50] Elizabeth F. Wanner,et al. Hybrid metaheuristic for combinatorial optimization based on immune network for optimization and VNS , 2017, GECCO.
[51] Greet Vanden Berghe,et al. Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem , 2019, Int. Trans. Oper. Res..
[52] Shu-Cherng Fang,et al. An Electromagnetism-like Mechanism for Global Optimization , 2003, J. Glob. Optim..
[53] Chung-Cheng Lu,et al. Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints , 2011 .
[54] B. Vahdani,et al. A robust parameter design for multi-response problems , 2009 .
[55] Javad Rezaeian,et al. Design of high-performing hybrid meta-heuristics for unrelated parallel machine scheduling with machine eligibility and precedence constraints , 2016 .
[56] Dechang Pi,et al. Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms , 2017, Knowl. Based Syst..
[57] John W. Fowler,et al. A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence dependent setups , 2003 .
[58] Jeng-Fung Chen,et al. Scheduling on unrelated parallel machines with sequence- and machine-dependent setup times and due-date constraints , 2009 .
[59] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[60] Liang Gao,et al. A multi-start variable neighbourhood descent algorithm for hybrid flowshop rescheduling , 2019, Swarm Evol. Comput..
[61] F. Wilcoxon. Individual Comparisons by Ranking Methods , 1945 .
[62] Seyda Topaloglu,et al. A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem , 2017, Comput. Oper. Res..
[63] Panos M. Pardalos,et al. A variable neighborhood search heuristic algorithm for production routing problems , 2018, Appl. Soft Comput..
[64] Panos M. Pardalos,et al. Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times , 2008, Comput. Oper. Res..
[65] Chun-Lung Chen,et al. Iterated population-based VND algorithms for single-machine scheduling with sequence-dependent setup times , 2019, Soft Comput..