Bibliography¶
The sources of the methods, benchmarks, statistics, and figures DispatchAtlas implements, generated from the bibliography of the package when this site is built. Each entry lists the solvers, benchmark families, suites, figures, and statistical methods that cite it.
Export entries as BibTeX to cite what you use:
dispatchatlas references --solver tabu-search --family job-shop --format bibtex
dispatchatlas references kolisch1996serial --format bibtex
The bibliography holds 180 entries, sorted by citation key.
abualigah2021arithmetic: L. Abualigah, A. Diabat, S. Mirjalili, M. Abd Elaziz and A. H. Gandomi (2021). The Arithmetic Optimization Algorithm. Computer Methods in Applied Mechanics and Engineering 376:113609. https://doi.org/10.1016/j.cma.2020.113609
Cited by solver arithmetic-optimization-algorithm.
adams1988shifting: J. Adams, E. Balas and D. Zawack (1988). The shifting bottleneck procedure for job shop scheduling. Management Science 34(3):391-401. https://doi.org/10.1287/mnsc.34.3.391
Cited by suite orlib-job-shop.
alibaba2018cluster: Alibaba Group (2018). Alibaba Cluster Trace Program: cluster-trace-v2018. GitHub repository alibaba/clusterdata. https://github.com/alibaba/clusterdata
applegate1991computational: D. Applegate and W. Cook (1991). A computational study of the job-shop scheduling problem. ORSA Journal on Computing 3(2):149-156. https://doi.org/10.1287/ijoc.3.2.149
Cited by suite orlib-job-shop.
auer2002finite: P. Auer, N. Cesa-Bianchi and P. Fischer (2002). Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2-3):235-256. https://doi.org/10.1023/A:1013689704352
Cited by solver monte-carlo-tree-search.
aydin2000dynamic: M. E. Aydin and E. Öztemel (2000). Dynamic job-shop scheduling using reinforcement learning agents. Robotics and Autonomous Systems 33(2-3):169-178. https://doi.org/10.1016/S0921-8890(00)00087-7
Cited by solver q-learning-dispatching, solver sarsa-dispatching.
bean1994genetic: J. C. Bean (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing 6(2):154-160. https://doi.org/10.1287/ijoc.6.2.154
Cited by solver arithmetic-optimization-algorithm, solver artificial-bee-colony, solver brkga, solver clpso, solver cma-es, solver cuckoo-search, solver differential-evolution, solver firefly-algorithm, solver gravitational-search-algorithm, solver grey-wolf-optimizer, solver harris-hawks-optimization, solver jaya, solver lshade, solver marine-predators-algorithm, solver moth-flame-optimization, solver particle-swarm-optimization, solver salp-swarm-algorithm, solver sine-cosine-algorithm, solver teaching-learning-based-optimization, solver umda, solver whale-optimization-algorithm.
beasley1990orlibrary: J. E. Beasley (1990). OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41(11):1069-1072. https://doi.org/10.1057/jors.1990.166
Cited by suite taillard-flow-shop, suite taillard-job-shop, suite taillard-open-shop, suite orlib-job-shop, suite orlib-flow-shop.
beume2007smsemoa: N. Beume, B. Naujoks and M. Emmerich (2007). SMS-EMOA: Multiobjective selection based on dominated hypervolume. European Journal of Operational Research 181(3):1653-1669. https://doi.org/10.1016/j.ejor.2006.08.008
Cited by solver sms-emoa.
bharathi2008characterization: S. Bharathi, A. Chervenak, E. Deelman, G. Mehta, M.-H. Su and K. Vahi (2008). Characterization of scientific workflows. Proceedings of the Third Workshop on Workflows in Support of Large-Scale Science (WORKS), 1-10. https://doi.org/10.1109/WORKS.2008.4723958
brandimarte1993routing: P. Brandimarte (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research 41(3):157-183. https://doi.org/10.1007/BF02023073
Cited by family flexible-job-shop, suite brandimarte.
braun2001comparison: T. D. Braun, H. J. Siegel, N. Beck, L. L. Bölöni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, B. Yao, D. Hensgen and R. F. Freund (2001). A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing 61(6):810-837. https://doi.org/10.1006/jpdc.2000.1714
Cited by solver max-min, solver min-min.
burke2013hyper: E. K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. Özcan and R. Qu (2013). Hyper-heuristics: a survey of the state of the art. Journal of the Operational Research Society 64(12):1695-1724. https://doi.org/10.1057/jors.2013.71
Cited by solver gp-hyper-heuristic, solver selection-hyper-heuristic.
burke2017late: E. K. Burke and Y. Bykov (2017). The late acceptance hill-climbing heuristic. European Journal of Operational Research 258(1):70-78. https://doi.org/10.1016/j.ejor.2016.07.012
Cited by solver late-acceptance-hill-climbing, solver selection-hyper-heuristic.
camachovillalon2020grey: C. L. Camacho-Villalón, T. Stützle and M. Dorigo (2020). Grey wolf, firefly and bat algorithms: Three widespread algorithms that do not contain any novelty. Swarm Intelligence (ANTS 2020), Lecture Notes in Computer Science 12421:121-133. https://doi.org/10.1007/978-3-030-60376-2_10
camachovillalon2022analysis: C. L. Camacho-Villalón, M. Dorigo and T. Stützle (2022). An analysis of why cuckoo search does not bring any novel ideas to optimization. Computers & Operations Research 142:105747. https://doi.org/10.1016/j.cor.2022.105747
camachovillalon2023exposing: C. L. Camacho-Villalón, M. Dorigo and T. Stützle (2023). Exposing the grey wolf, moth-flame, whale, firefly, bat, and antlion algorithms: Six misleading optimization techniques inspired by bestial metaphors. International Transactions in Operational Research 30(6):2945-2971. https://doi.org/10.1111/itor.13176
campelo2019sample: F. Campelo and F. Takahashi (2019). Sample size estimation for power and accuracy in the experimental comparison of algorithms. Journal of Heuristics 25(2):305-338. https://doi.org/10.1007/s10732-018-9396-7
Cited by method Power of the Wilcoxon signed-rank test.
carlier1978ordonnancements: J. Carlier (1978). Ordonnancements à contraintes disjonctives. RAIRO Recherche Opérationnelle 12(4):333-350. https://doi.org/10.1051/ro/1978120403331
Cited by suite orlib-flow-shop.
carrasco2020recent: J. Carrasco, S. García, M. M. Rueda, S. Das and F. Herrera (2020). Recent trends in the use of statistical tests for comparing swarm and evolutionary computing algorithms: Practical guidelines and a critical review. Swarm and Evolutionary Computation 54:100665. https://doi.org/10.1016/j.swevo.2020.100665
Cited by method Effect sizes and intervals beside every p-value.
castelli2022salp: M. Castelli, L. Manzoni, L. Mariot, M. S. Nobile and A. Tangherloni (2022). Salp Swarm Optimization: A critical review. Expert Systems with Applications 189:116029. https://doi.org/10.1016/j.eswa.2021.116029
cheng2016reference: R. Cheng, Y. Jin, M. Olhofer and B. Sendhoff (2016). A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Transactions on Evolutionary Computation 20(5):773-791. https://doi.org/10.1109/TEVC.2016.2519378
Cited by solver rvea.
cliff1993dominance: N. Cliff (1993). Dominance statistics: Ordinal analyses to answer ordinal questions. Psychological Bulletin 114(3):494-509. https://doi.org/10.1037/0033-2909.114.3.494
Cited by method Cliff's delta.
coello2004study: C. A. Coello Coello and M. Reyes Sierra (2004). A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm. MICAI 2004: Advances in Artificial Intelligence, Lecture Notes in Computer Science 2972:688-697. https://doi.org/10.1007/978-3-540-24694-7_71
Cited by method Inverted generational distance.
cohen1988statistical: J. Cohen (1988). Statistical Power Analysis for the Behavioral Sciences. 2nd edition, Lawrence Erlbaum Associates, Hillsdale, NJ; reissued by Routledge in 2013. https://doi.org/10.4324/9780203771587
Cited by method Cohen's d_z, method Cohen's d_s.
coleman2022wfcommons: T. Coleman, H. Casanova, L. Pottier, M. Kaushik, E. Deelman and R. Ferreira da Silva (2022). WfCommons: A framework for enabling scientific workflow research and development. Future Generation Computer Systems 128:16-27. https://doi.org/10.1016/j.future.2021.09.043
crauwels1998local: H. A. J. Crauwels, C. N. Potts and L. N. Van Wassenhove (1998). Local search heuristics for the single machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 10(3):341-350. https://doi.org/10.1287/ijoc.10.3.341
Cited by family parallel-machines.
crepinsek2012note: M. Črepinšek, S.-H. Liu and L. Mernik (2012). A note on teaching–learning-based optimization algorithm. Information Sciences 212:79-93. https://doi.org/10.1016/j.ins.2012.05.009
das1998normalboundary: I. Das and J. E. Dennis (1998). Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM Journal on Optimization 8(3):631-657. https://doi.org/10.1137/S1052623496307510
Cited by solver moea-d, solver nsga-iii, solver rvea.
davis1985applying: L. Davis (1985). Applying adaptive algorithms to epistatic domains. Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI-85), 162-164. https://www.ijcai.org/Proceedings/85-1/Papers/029.pdf
Cited by solver age-moea-ii, solver genetic-algorithm, solver ibea, solver memetic-algorithm, solver moea-d, solver nsga-ii, solver nsga-iii, solver rvea, solver sms-emoa, solver spea2.
deb2000efficient: K. Deb (2000). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering 186(2-4):311-338. https://doi.org/10.1016/S0045-7825(99)00389-8
Cited by solver artificial-bee-colony, solver gravitational-search-algorithm.
deb2002fast: K. Deb, A. Pratap, S. Agarwal and T. Meyarivan (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2):182-197. https://doi.org/10.1109/4235.996017
Cited by solver age-moea-ii, solver ibea, solver moea-d, solver nsga-ii, solver nsga-iii, solver sms-emoa, solver spea2.
deb2014evolutionary: K. Deb and H. Jain (2014). An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: Solving problems with box constraints. IEEE Transactions on Evolutionary Computation 18(4):577-601. https://doi.org/10.1109/TEVC.2013.2281535
Cited by solver nsga-iii.
deelman2015pegasus: E. Deelman, K. Vahi, G. Juve, M. Rynge, S. Callaghan, P. J. Maechling, R. Mayani, W. Chen, R. Ferreira da Silva, M. Livny and K. Wenger (2015). Pegasus, a workflow management system for science automation. Future Generation Computer Systems 46:17-35. https://doi.org/10.1016/j.future.2014.10.008
demsar2006statistical: J. Demšar (2006). Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research 7:1-30. https://jmlr.org/papers/v7/demsar06a.html
Cited by figure critical-difference diagram, method Friedman test, method Iman-Davenport test, method Nemenyi test, method Paired win share.
dereyck1999multi: B. De Reyck and W. Herroelen (1999). The multi-mode resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research 119(2):538-556. https://doi.org/10.1016/S0377-2217(99)00151-4
Cited by solver mode-assignment-tabu.
derrac2011practical: J. Derrac, S. García, D. Molina and F. Herrera (2011). A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation 1(1):3-18. https://doi.org/10.1016/j.swevo.2011.02.002
Cited by method Wilcoxon signed-rank test.
dixon1946statistical: W. J. Dixon and A. M. Mood (1946). The statistical sign test. Journal of the American Statistical Association 41(236):557-566. https://doi.org/10.1080/01621459.1946.10501898
Cited by method Sign test.
dolan2002benchmarking: E. D. Dolan and J. J. Moré (2002). Benchmarking optimization software with performance profiles. Mathematical Programming 91(2):201-213. https://doi.org/10.1007/s101070100263
Cited by figure performance profile.
dorigo1996ant: M. Dorigo, V. Maniezzo and A. Colorni (1996). Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 26(1):29-41. https://doi.org/10.1109/3477.484436
Cited by solver ant-colony-optimization.
dueck1990threshold: G. Dueck and T. Scheuer (1990). Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics 90(1):161-175. https://doi.org/10.1016/0021-9991(90)90201-B
Cited by solver threshold-accepting.
dueck1993new: G. Dueck (1993). New optimization heuristics: The great deluge algorithm and the record-to-record travel. Journal of Computational Physics 104(1):86-92. https://doi.org/10.1006/jcph.1993.1010
Cited by solver great-deluge, solver record-to-record-travel.
dunn1961multiple: O. J. Dunn (1961). Multiple comparisons among means. Journal of the American Statistical Association 56(293):52-64. https://doi.org/10.1080/01621459.1961.10482090
Cited by method Bonferroni correction.
efron1987better: B. Efron (1987). Better bootstrap confidence intervals. Journal of the American Statistical Association 82(397):171-185. https://doi.org/10.1080/01621459.1987.10478410
Cited by method Bias-corrected and accelerated bootstrap interval, method Percentile bootstrap interval.
emmerich2005emo: M. Emmerich, N. Beume and B. Naujoks (2005). An EMO algorithm using the hypervolume measure as selection criterion. Evolutionary Multi-Criterion Optimization (EMO 2005), Lecture Notes in Computer Science 3410:62-76. https://doi.org/10.1007/978-3-540-31880-4_5
Cited by solver sms-emoa.
fan2007power: X. Fan, W.-D. Weber and L. A. Barroso (2007). Power provisioning for a warehouse-sized computer. Proceedings of the 34th Annual International Symposium on Computer Architecture (ISCA), 13-23. https://doi.org/10.1145/1250662.1250665
Cited by family continuum-offloading, family continuum-pipeline, family continuum-workflow.
faramarzi2020marine: A. Faramarzi, M. Heidarinejad, S. Mirjalili and A. H. Gandomi (2020). Marine Predators Algorithm: A nature-inspired metaheuristic. Expert Systems with Applications 152:113377. https://doi.org/10.1016/j.eswa.2020.113377
Cited by solver marine-predators-algorithm.
feo1995greedy: T. A. Feo and M. G. C. Resende (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization 6(2):109-133. https://doi.org/10.1007/BF01096763
Cited by solver grasp.
finner1993monotonicity: H. Finner (1993). On a monotonicity problem in step-down multiple test procedures. Journal of the American Statistical Association 88(423):920-923. https://doi.org/10.1080/01621459.1993.10476358
Cited by method Finner correction.
fisher1963probabilistic: H. Fisher and G. L. Thompson (1963). Probabilistic learning combinations of local job-shop scheduling rules. In J. F. Muth and G. L. Thompson (eds.), Industrial Scheduling, Prentice-Hall, Englewood Cliffs, 225-251.
Cited by suite orlib-job-shop.
fonseca1996performance: C. M. Fonseca and P. J. Fleming (1996). On the performance assessment and comparison of stochastic multiobjective optimizers. Parallel Problem Solving from Nature - PPSN IV, Lecture Notes in Computer Science 1141:584-593. https://doi.org/10.1007/3-540-61723-X_1022
Cited by figure pareto fronts.
forrest2005cbc: J. Forrest and R. Lougee-Heimer (2005). CBC user guide. Emerging Theory, Methods, and Applications, INFORMS Tutorials in Operations Research, 257-277. https://doi.org/10.1287/educ.1053.0020
Cited by solver milp.
friedman1937use: M. Friedman (1937). The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association 32(200):675-701. https://doi.org/10.1080/01621459.1937.10503522
Cited by method Friedman test.
garcia2008extension: S. García and F. Herrera (2008). An extension on "Statistical comparisons of classifiers over multiple data sets" for all pairwise comparisons. Journal of Machine Learning Research 9:2677-2694. https://jmlr.org/papers/v9/garcia08a.html
Cited by method Holm correction, method Hochberg correction, method Shaffer correction, method Finner correction.
gauci2012why: M. Gauci, T. J. Dodd and R. Groß (2012). Why 'GSA: a gravitational search algorithm' is not genuinely based on the law of gravity. Natural Computing 11(4):719-720. https://doi.org/10.1007/s11047-012-9322-0
glover1986future: F. Glover (1986). Future paths for integer programming and links to artificial intelligence. Computers & Operations Research 13(5):533-549. https://doi.org/10.1016/0305-0548(86)90048-1
Cited by solver tabu-search.
glover1989tabu: F. Glover (1989). Tabu search—Part I. ORSA Journal on Computing 1(3):190-206. https://doi.org/10.1287/ijoc.1.3.190
Cited by solver tabu-search.
glover1998template: F. Glover (1998). A template for scatter search and path relinking. Artificial Evolution (AE 1997), Lecture Notes in Computer Science 1363:1-51. https://doi.org/10.1007/BFb0026589
Cited by solver scatter-search.
goncalves2011biased: J. F. Gonçalves and M. G. C. Resende (2011). Biased random-key genetic algorithms for combinatorial optimization. Journal of Heuristics 17(5):487-525. https://doi.org/10.1007/s10732-010-9143-1
Cited by solver brkga.
gonzalez1976open: T. Gonzalez and S. Sahni (1976). Open shop scheduling to minimize finish time. Journal of the ACM 23(4):665-679. https://doi.org/10.1145/321978.321985
Cited by family open-shop.
gould2016note: N. Gould and J. Scott (2016). A note on performance profiles for benchmarking software. ACM Transactions on Mathematical Software 43(2):15. https://doi.org/10.1145/2950048
Cited by figure performance profile.
guo2019limits: J. Guo, Z. Chang, S. Wang, H. Ding, Y. Feng, L. Mao and Y. Bao (2019). Who limits the resource efficiency of my datacenter: An analysis of Alibaba datacenter traces. Proceedings of the International Symposium on Quality of Service (IWQoS), 1-10. https://doi.org/10.1145/3326285.3329074
gupta2017ifogsim: H. Gupta, A. Vahid Dastjerdi, S. K. Ghosh and R. Buyya (2017). iFogSim: A toolkit for modeling and simulation of resource management techniques in the Internet of Things, Edge and Fog computing environments. Software: Practice and Experience 47(9):1275-1296. https://doi.org/10.1002/spe.2509
Cited by family continuum-offloading, family continuum-pipeline, family continuum-workflow.
hansen2001completely: N. Hansen and A. Ostermeier (2001). Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation 9(2):159-195. https://doi.org/10.1162/106365601750190398
Cited by solver cma-es.
hansen2003reducing: N. Hansen, S. D. Müller and P. Koumoutsakos (2003). Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evolutionary Computation 11(1):1-18. https://doi.org/10.1162/106365603321828970
Cited by solver cma-es.
hansen2016cma: N. Hansen (2016). The CMA evolution strategy: A tutorial. arXiv preprint 1604.00772. https://doi.org/10.48550/arXiv.1604.00772
Cited by solver cma-es.
hansen2022anytime: N. Hansen, A. Auger, D. Brockhoff and T. Tušar (2022). Anytime performance assessment in blackbox optimization benchmarking. IEEE Transactions on Evolutionary Computation 26(6):1293-1305. https://doi.org/10.1109/TEVC.2022.3210897
Cited by figure runtime to reach quality targets.
hartmann1998competitive: S. Hartmann (1998). A competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics 45(7):733-750. <https://doi.org/10.1002/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C>
Cited by solver genetic-algorithm.
heidari2019harris: A. A. Heidari, S. Mirjalili, H. Faris, I. Aljarah, M. Mafarja and H. Chen (2019). Harris hawks optimization: Algorithm and applications. Future Generation Computer Systems 97:849-872. https://doi.org/10.1016/j.future.2019.02.028
Cited by solver harris-hawks-optimization.
heller1960numerical: J. Heller (1960). Some numerical experiments for an M × J flow shop and its decision-theoretical aspects. Operations Research 8(2):178-184. https://doi.org/10.1287/opre.8.2.178
Cited by suite orlib-flow-shop.
hildebrandt2015using: T. Hildebrandt and J. Branke (2015). On using surrogates with genetic programming. Evolutionary Computation 23(3):343-367. https://doi.org/10.1162/EVCO_a_00133
Cited by solver gp-hyper-heuristic.
hochberg1988sharper: Y. Hochberg (1988). A sharper Bonferroni procedure for multiple tests of significance. Biometrika 75(4):800-802. https://doi.org/10.1093/biomet/75.4.800
Cited by method Hochberg correction.
holland1992adaptation: J. H. Holland (1992). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. MIT Press, Cambridge, MA; first published by the University of Michigan Press, 1975. https://doi.org/10.7551/mitpress/1090.001.0001
Cited by solver genetic-algorithm.
holm1979simple: S. Holm (1979). A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics 6(2):65-70. https://www.jstor.org/stable/4615733
Cited by method Holm correction.
hoos2004stochastic: H. H. Hoos and T. Stützle (2004). Stochastic local search: Foundations and applications. Morgan Kaufmann, ISBN 1-55860-872-9. https://www.cs.ubc.ca/~hoos/SLS-Book/
Cited by solver hill-climbing.
huangfu2018parallelizing: Q. Huangfu and J. A. J. Hall (2018). Parallelizing the dual revised simplex method. Mathematical Programming Computation 10(1):119-142. https://doi.org/10.1007/s12532-017-0130-5
Cited by solver milp.
hyndman1996sample: R. J. Hyndman and Y. Fan (1996). Sample quantiles in statistical packages. The American Statistician 50(4):361-365. https://doi.org/10.1080/00031305.1996.10473566
Cited by figure relative deviation from the best value found, method Bias-corrected and accelerated bootstrap interval, method Percentile bootstrap interval.
ibarra1977heuristic: O. H. Ibarra and C. E. Kim (1977). Heuristic algorithms for scheduling independent tasks on nonidentical processors. Journal of the ACM 24(2):280-289. https://doi.org/10.1145/322003.322011
Cited by solver max-min, solver min-min.
iman1980approximations: R. L. Iman and J. M. Davenport (1980). Approximations of the critical region of the Friedman statistic. Communications in Statistics - Theory and Methods 9(6):571-595. https://doi.org/10.1080/03610928008827904
Cited by method Iman-Davenport test.
ishibuchi2015modified: H. Ishibuchi, H. Masuda, Y. Tanigaki and Y. Nojima (2015). Modified distance calculation in generational distance and inverted generational distance. Evolutionary Multi-Criterion Optimization (EMO 2015), Lecture Notes in Computer Science 9019:110-125. https://doi.org/10.1007/978-3-319-15892-1_8
Cited by method IGD+.
ishibuchi2018specify: H. Ishibuchi, R. Imada, Y. Setoguchi and Y. Nojima (2018). How to specify a reference point in hypervolume calculation for fair performance comparison. Evolutionary Computation 26(3):411-440. https://doi.org/10.1162/evco_a_00226
Cited by method Hypervolume.
johnson1989optimization: D. S. Johnson, C. R. Aragon, L. A. McGeoch and C. Schevon (1989). Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning. Operations Research 37(6):865-892. https://doi.org/10.1287/opre.37.6.865
Cited by solver simulated-annealing.
joslin1999squeaky: D. E. Joslin and D. P. Clements (1999). Squeaky wheel optimization. Journal of Artificial Intelligence Research 10:353-373. https://doi.org/10.1613/jair.561
Cited by solver squeaky-wheel-optimization.
juve2013characterizing: G. Juve, A. Chervenak, E. Deelman, S. Bharathi, G. Mehta and K. Vahi (2013). Characterizing and profiling scientific workflows. Future Generation Computer Systems 29(3):682-692. https://doi.org/10.1016/j.future.2012.08.015
kang2017neurosurgeon: Y. Kang, J. Hauswald, C. Gao, A. Rovinski, T. Mudge, J. Mars and L. Tang (2017). Neurosurgeon: Collaborative intelligence between the cloud and mobile edge. Proceedings of the 22nd International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 615-629. https://doi.org/10.1145/3037697.3037698
Cited by family continuum-pipeline.
karaboga2007powerful: D. Karaboga and B. Basturk (2007). A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization 39(3):459-471. https://doi.org/10.1007/s10898-007-9149-x
Cited by solver artificial-bee-colony.
kendall1939problem: M. G. Kendall and B. Babington Smith (1939). The problem of m rankings. The Annals of Mathematical Statistics 10(3):275-287. https://doi.org/10.1214/aoms/1177732186
Cited by method Kendall's W.
kennedy1995particle: J. Kennedy and R. Eberhart (1995). Particle swarm optimization. Proceedings of ICNN'95, International Conference on Neural Networks 4:1942-1948. https://doi.org/10.1109/ICNN.1995.488968
Cited by solver particle-swarm-optimization.
kirkpatrick1983optimization: S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi (1983). Optimization by simulated annealing. Science 220(4598):671-680. https://doi.org/10.1126/science.220.4598.671
Cited by solver simulated-annealing.
kocsis2006bandit: L. Kocsis and C. Szepesvári (2006). Bandit based Monte-Carlo planning. Machine Learning: ECML 2006, J. Fürnkranz, T. Scheffer and M. Spiliopoulou (eds.), Lecture Notes in Computer Science, Springer, 282-293. https://doi.org/10.1007/11871842_29
Cited by solver monte-carlo-tree-search.
kolisch1995characterization: R. Kolisch, A. Sprecher and A. Drexl (1995). Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science 41(10):1693-1703. https://doi.org/10.1287/mnsc.41.10.1693
Cited by family multi-mode-rcpsp, family rcpsp, suite psplib-j30, suite psplib-j60, suite psplib-j90, suite psplib-j120.
kolisch1996serial: R. Kolisch (1996). Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research 90(2):320-333. https://doi.org/10.1016/0377-2217(95)00357-6
Cited by solver earliest-due-date, solver enumeration, solver input-order, solver least-slack, solver longest-processing-time, solver longest-remaining-path, solver most-work-remaining, solver random-search, solver reinforce-priority-policy.
kolisch1997psplib: R. Kolisch and A. Sprecher (1997). PSPLIB - A project scheduling problem library. European Journal of Operational Research 96(1):205-216. https://doi.org/10.1016/S0377-2217(96)00170-1
Cited by family multi-mode-rcpsp, family rcpsp, suite psplib-j30, suite psplib-j60, suite psplib-j90, suite psplib-j120.
koza1992genetic: J. R. Koza (1992). Genetic programming: On the programming of computers by means of natural selection. MIT Press, Cambridge, MA. https://mitpress.mit.edu/9780262527910/genetic-programming/
Cited by solver gp-hyper-heuristic.
kudela2022critical: J. Kůdela (2022). A critical problem in benchmarking and analysis of evolutionary computation methods. Nature Machine Intelligence 4(12):1238-1245. https://doi.org/10.1038/s42256-022-00579-0
kudela2023evolutionary: J. Kůdela (2023). The evolutionary computation methods no one should use. arXiv preprint 2301.01984. https://doi.org/10.48550/arXiv.2301.01984
larranaga2002estimation: P. Larrañaga and J. A. Lozano (eds.) (2002). Estimation of distribution algorithms: A new tool for evolutionary computation. Genetic Algorithms and Evolutionary Computation 2, Kluwer Academic Publishers, Boston, MA. https://doi.org/10.1007/978-1-4615-1539-5
Cited by solver umda.
lawrence1984resource: S. Lawrence (1984). Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (Supplement). Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh.
Cited by suite orlib-job-shop.
liang2006comprehensive: J. J. Liang, A. K. Qin, P. N. Suganthan and S. Baskar (2006). Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Transactions on Evolutionary Computation 10(3):281-295. https://doi.org/10.1109/TEVC.2005.857610
Cited by solver clpso.
lourenco2003iterated: H. R. Lourenço, O. C. Martin and T. Stützle (2003). Iterated local search. Handbook of Metaheuristics, F. Glover and G. A. Kochenberger (eds.), Kluwer Academic Publishers, 320-353. https://doi.org/10.1007/0-306-48056-5_11
Cited by solver iterated-local-search.
maheswaran1999dynamic: M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen and R. F. Freund (1999). Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing 59(2):107-131. https://doi.org/10.1006/jpdc.1999.1581
Cited by solver sufferage.
mann1947test: H. B. Mann and D. R. Whitney (1947). On a test of whether one of two random variables is stochastically larger than the other. The Annals of Mathematical Statistics 18(1):50-60. https://doi.org/10.1214/aoms/1177730491
Cited by method Mann-Whitney U test.
mantegna1994fast: R. N. Mantegna (1994). Fast, accurate algorithm for numerical simulation of Lévy stable stochastic processes. Physical Review E 49(5):4677-4683. https://doi.org/10.1103/PhysRevE.49.4677
Cited by solver cuckoo-search, solver harris-hawks-optimization, solver marine-predators-algorithm.
mao2017survey: Y. Mao, C. You, J. Zhang, K. Huang and K. B. Letaief (2017). A survey on mobile edge computing: The communication perspective. IEEE Communications Surveys & Tutorials 19(4):2322-2358. https://doi.org/10.1109/COMST.2017.2745201
Cited by family continuum-offloading.
marti2006principles: R. Martí, M. Laguna and F. Glover (2006). Principles of scatter search. European Journal of Operational Research 169(2):359-372. https://doi.org/10.1016/j.ejor.2004.08.004
Cited by solver scatter-search.
mastrolilli2000effective: M. Mastrolilli and L. M. Gambardella (2000). Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling 3(1):3-20. <https://doi.org/10.1002/(SICI)1099-1425(200001/02)3:1<3::AID-JOS32>3.0.CO;2-Y>
Cited by suite brandimarte.
merkle2002ant: D. Merkle, M. Middendorf and H. Schmeck (2002). Ant colony optimization for resource-constrained project scheduling. IEEE Transactions on Evolutionary Computation 6(4):333-346. https://doi.org/10.1109/TEVC.2002.802450
Cited by solver ant-colony-optimization.
mirjalili2014grey: S. Mirjalili, S. M. Mirjalili and A. Lewis (2014). Grey Wolf Optimizer. Advances in Engineering Software 69:46-61. https://doi.org/10.1016/j.advengsoft.2013.12.007
Cited by solver grey-wolf-optimizer.
mirjalili2015moth: S. Mirjalili (2015). Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm. Knowledge-Based Systems 89:228-249. https://doi.org/10.1016/j.knosys.2015.07.006
Cited by solver moth-flame-optimization.
mirjalili2016sca: S. Mirjalili (2016). SCA: A Sine Cosine Algorithm for solving optimization problems. Knowledge-Based Systems 96:120-133. https://doi.org/10.1016/j.knosys.2015.12.022
Cited by solver sine-cosine-algorithm.
mirjalili2016whale: S. Mirjalili and A. Lewis (2016). The Whale Optimization Algorithm. Advances in Engineering Software 95:51-67. https://doi.org/10.1016/j.advengsoft.2016.01.008
Cited by solver whale-optimization-algorithm.
mirjalili2017salp: S. Mirjalili, A. H. Gandomi, S. Z. Mirjalili, S. Saremi, H. Faris and S. M. Mirjalili (2017). Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems. Advances in Engineering Software 114:163-191. https://doi.org/10.1016/j.advengsoft.2017.07.002
Cited by solver salp-swarm-algorithm.
mitchell2011pulp: S. Mitchell, M. O'Sullivan and I. Dunning (2011). PuLP: A linear programming toolkit for Python. Department of Engineering Science, The University of Auckland, Optimization Online preprint. https://optimization-online.org/2011/09/3178/
Cited by solver milp.
mladenovic1997variable: N. Mladenović and P. Hansen (1997). Variable neighborhood search. Computers & Operations Research 24(11):1097-1100. https://doi.org/10.1016/S0305-0548(97)00031-2
Cited by solver variable-neighbourhood-search.
more2009benchmarking: J. J. Moré and S. M. Wild (2009). Benchmarking derivative-free optimization algorithms. SIAM Journal on Optimization 20(1):172-191. https://doi.org/10.1137/080724083
Cited by figure data profile.
moscato1989evolution: P. Moscato (1989). On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech Concurrent Computation Program, C3P Report 826, California Institute of Technology, Pasadena, CA. https://www.semanticscholar.org/paper/8b9a748ae77f9235396e04301b82143feb1167fe
Cited by solver memetic-algorithm.
muhlenbein1996recombination: H. Mühlenbein and G. Paaß (1996). From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature (PPSN IV), Lecture Notes in Computer Science 1141:178-187. https://doi.org/10.1007/3-540-61723-X_982
Cited by solver umda.
nareyek2003choosing: A. Nareyek (2003). Choosing search heuristics by non-stationary reinforcement learning. Metaheuristics: Computer Decision-Making, Applied Optimization, Springer, 523-544. https://doi.org/10.1007/978-1-4757-4137-7_25
Cited by solver selection-hyper-heuristic.
nawaz1983heuristic: M. Nawaz, E. E. Enscore and I. Ham (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91-95. https://doi.org/10.1016/0305-0483(83)90088-9
Cited by solver iterated-greedy, solver neh.
niu2019defect: P. Niu, S. Niu, N. Liu and L. Chang (2019). The defect of the Grey Wolf optimization algorithm and its verification method. Knowledge-Based Systems 171:37-43. https://doi.org/10.1016/j.knosys.2019.01.018
ow1988filtered: P. S. Ow and T. E. Morton (1988). Filtered beam search in scheduling. International Journal of Production Research 26(1):35-62. https://doi.org/10.1080/00207548808947840
Cited by solver beam-search.
ozcan2009examination: E. Özcan, Y. Bykov, M. Birben and E. K. Burke (2009). Examination timetabling using late acceptance hyper-heuristics. 2009 IEEE Congress on Evolutionary Computation, 997-1004. https://doi.org/10.1109/CEC.2009.4983054
Cited by solver selection-hyper-heuristic.
panichella2019adaptive: A. Panichella (2019). An adaptive evolutionary algorithm based on non-euclidean geometry for many-objective optimization. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '19), 595-603. https://doi.org/10.1145/3321707.3321839
Cited by solver age-moea-ii.
panichella2022improved: A. Panichella (2022). An improved Pareto front modeling algorithm for large-scale many-objective optimization. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '22), 565-573. https://doi.org/10.1145/3512290.3528732
Cited by solver age-moea-ii.
panwalkar1977survey: S. S. Panwalkar and W. Iskander (1977). A survey of scheduling rules. Operations Research 25(1):45-61. https://doi.org/10.1287/opre.25.1.45
Cited by solver earliest-due-date, solver least-slack, solver longest-processing-time, solver most-work-remaining, solver q-learning-dispatching, solver sarsa-dispatching, solver shortest-processing-time.
perron2023cpsatlp: L. Perron, F. Didier and S. Gay (2023). The CP-SAT-LP solver. 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), LIPIcs 280:3:1-3:2. https://doi.org/10.4230/LIPIcs.CP.2023.3
Cited by solver cp-sat.
perron2026ortools: L. Perron and V. Furnon (2026). OR-Tools. Google, software, version 9.15. https://developers.google.com/optimization/
Cited by solver cp-sat.
pisinger2010large: D. Pisinger and S. Ropke (2010). Large neighborhood search. Handbook of Metaheuristics, M. Gendreau and J.-Y. Potvin (eds.), International Series in Operations Research & Management Science, Springer, 399-419. https://doi.org/10.1007/978-1-4419-1665-5_13
Cited by solver restricted-neighbourhood-search.
pritsker1969multiproject: A. A. B. Pritsker, L. J. Watters and P. M. Wolfe (1969). Multiproject scheduling with limited resources: A zero-one programming approach. Management Science 16(1):93-108. https://doi.org/10.1287/mnsc.16.1.93
Cited by solver milp.
rao2011teaching: R. V. Rao, V. J. Savsani and D. P. Vakharia (2011). Teaching–learning-based optimization: A novel method for constrained mechanical design optimization problems. Computer-Aided Design 43(3):303-315. https://doi.org/10.1016/j.cad.2010.12.015
Cited by solver teaching-learning-based-optimization.
rao2016jaya: R. V. Rao (2016). Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. International Journal of Industrial Engineering Computations 7(1):19-34. https://doi.org/10.5267/j.ijiec.2015.8.004
Cited by solver jaya.
rashedi2009gsa: E. Rashedi, H. Nezamabadi-pour and S. Saryazdi (2009). GSA: A Gravitational Search Algorithm. Information Sciences 179(13):2232-2248. https://doi.org/10.1016/j.ins.2009.03.004
Cited by solver gravitational-search-algorithm.
reeves1995genetic: C. R. Reeves (1995). A genetic algorithm for flowshop sequencing. Computers & Operations Research 22(1):5-13. https://doi.org/10.1016/0305-0548(93)E0014-K
Cited by suite orlib-flow-shop.
romano2006appropriate: J. Romano, J. D. Kromrey, J. Coraggio and J. Skowronek (2006). Appropriate statistics for ordinal level data: Should we really be using t-test and Cohen's d for evaluating group differences on the NSSE and other surveys?. Annual meeting of the Florida Association of Institutional Research.
Cited by method Cliff's delta.
ropke2006adaptive: S. Ropke and D. Pisinger (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40(4):455-472. https://doi.org/10.1287/trsc.1050.0135
Cited by solver alns.
ruiz2007simple: R. Ruiz and T. Stützle (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177(3):2033-2049. https://doi.org/10.1016/j.ejor.2005.12.009
Cited by solver iterated-greedy, solver memetic-algorithm.
ruiz2010hybrid: R. Ruiz and J. A. Vázquez-Rodríguez (2010). The hybrid flow shop scheduling problem. European Journal of Operational Research 205(1):1-18. https://doi.org/10.1016/j.ejor.2009.09.024
Cited by family hybrid-flow-shop.
rummery1994online: G. A. Rummery and M. Niranjan (1994). On-line Q-learning using connectionist systems. Technical report CUED/F-INFENG/TR 166, Cambridge University Engineering Department. https://www.semanticscholar.org/paper/On-line-Q-learning-using-connectionist-systems-Rummery-Niranjan/7a09464f26e18a25a948baaa736270bfb84b5e12
Cited by solver sarsa-dispatching.
sabuncuoglu1999job: I. Sabuncuoglu and M. Bayiz (1999). Job shop scheduling with beam search. European Journal of Operational Research 118(2):390-412. https://doi.org/10.1016/S0377-2217(98)00319-1
Cited by solver beam-search.
shaffer1986modified: J. P. Shaffer (1986). Modified sequentially rejective multiple test procedures. Journal of the American Statistical Association 81(395):826-831. https://doi.org/10.1080/01621459.1986.10478341
Cited by method Shaffer correction.
shaw1998using: P. Shaw (1998). Using constraint programming and local search methods to solve vehicle routing problems. Principles and Practice of Constraint Programming (CP98), Lecture Notes in Computer Science 1520:417-431. https://doi.org/10.1007/3-540-49481-2_30
Cited by solver alns, solver restricted-neighbourhood-search.
shi1998modified: Y. Shi and R. Eberhart (1998). A modified particle swarm optimizer. 1998 IEEE International Conference on Evolutionary Computation Proceedings (IEEE World Congress on Computational Intelligence), 69-73. https://doi.org/10.1109/ICEC.1998.699146
Cited by solver particle-swarm-optimization.
shi1999empirical: Y. Shi and R. C. Eberhart (1999). Empirical study of particle swarm optimization. Proceedings of the 1999 Congress on Evolutionary Computation (CEC99) 3:1945-1950. https://doi.org/10.1109/CEC.1999.785511
Cited by solver particle-swarm-optimization.
singer1998computational: M. Singer and M. Pinedo (1998). A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Transactions 30(2):109-118. https://doi.org/10.1080/07408179808966443
Cited by family flexible-job-shop, family flow-shop, family hybrid-flow-shop, family job-shop.
smith1956various: W. E. Smith (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly 3(1-2):59-66. https://doi.org/10.1002/nav.3800030106
Cited by solver shortest-processing-time.
sorensen2015metaheuristics: K. Sörensen (2015). Metaheuristics—the metaphor exposed. International Transactions in Operational Research 22(1):3-18. https://doi.org/10.1111/itor.12001
sprecher1995semiactive: A. Sprecher, R. Kolisch and A. Drexl (1995). Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research 80(1):94-102. https://doi.org/10.1016/0377-2217(93)E0294-8
Cited by solver enumeration.
storer1992new: R. H. Storer, S. D. Wu and R. Vaccari (1992). New search spaces for sequencing problems with application to job shop scheduling. Management Science 38(10):1495-1509. https://doi.org/10.1287/mnsc.38.10.1495
Cited by suite orlib-job-shop.
storn1997differential: R. Storn and K. Price (1997). Differential evolution – A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11(4):341-359. https://doi.org/10.1023/A:1008202821328
Cited by solver differential-evolution.
stutzle2000max: T. Stützle and H. H. Hoos (2000). MAX-MIN Ant System. Future Generation Computer Systems 16(8):889-914. https://doi.org/10.1016/S0167-739X(00)00043-1
Cited by solver ant-colony-optimization.
sutton2018reinforcement: R. S. Sutton and A. G. Barto (2018). Reinforcement learning: An introduction. MIT Press, Cambridge, MA, second edition. https://mitpress.mit.edu/9780262039246/reinforcement-learning/
Cited by solver sarsa-dispatching.
taillard1993benchmarks: E. Taillard (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research 64(2):278-285. https://doi.org/10.1016/0377-2217(93)90182-M
Cited by family flow-shop, family hybrid-flow-shop, family job-shop, family open-shop, suite taillard-flow-shop, suite taillard-job-shop, suite taillard-open-shop.
talbot1982resource: F. B. Talbot (1982). Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management Science 28(10):1197-1210. https://doi.org/10.1287/mnsc.28.10.1197
Cited by solver milp.
tanabe2013success: R. Tanabe and A. Fukunaga (2013). Success-history based parameter adaptation for differential evolution. 2013 IEEE Congress on Evolutionary Computation (CEC), 71-78. https://doi.org/10.1109/CEC.2013.6557555
Cited by solver lshade.
tanabe2014improving: R. Tanabe and A. S. Fukunaga (2014). Improving the search performance of SHADE using linear population size reduction. 2014 IEEE Congress on Evolutionary Computation (CEC), 1658-1665. https://doi.org/10.1109/CEC.2014.6900380
Cited by solver lshade.
tian2019characterizing: H. Tian, Y. Zheng and W. Wang (2019). Characterizing and synthesizing task dependencies of data-parallel jobs in Alibaba Cloud. Proceedings of the ACM Symposium on Cloud Computing (SoCC), 139-151. https://doi.org/10.1145/3357223.3362710
topcuoglu2002performance: H. Topcuoglu, S. Hariri and M.-Y. Wu (2002). Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems 13(3):260-274. https://doi.org/10.1109/71.993206
Cited by solver ant-colony-optimization, solver beam-search, solver heft, family continuum-workflow, family workflow.
vallada2011genetic: E. Vallada and R. Ruiz (2011). A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. European Journal of Operational Research 211(3):612-622. https://doi.org/10.1016/j.ejor.2011.01.011
Cited by family parallel-machines.
vallada2015new: E. Vallada, R. Ruiz and J. M. Framinan (2015). New hard benchmark for flowshop scheduling problems minimising makespan. European Journal of Operational Research 240(3):666-677. https://doi.org/10.1016/j.ejor.2014.07.033
Cited by method Average relative percentage deviation.
vargha2000critique: A. Vargha and H. D. Delaney (2000). A critique and improvement of the CL common language effect size statistics of McGraw and Wong. Journal of Educational and Behavioral Statistics 25(2):101-132. https://doi.org/10.3102/10769986025002101
Cited by method Vargha-Delaney A12.
voudouris1999guided: C. Voudouris and E. Tsang (1999). Guided local search and its application to the traveling salesman problem. European Journal of Operational Research 113(2):469-499. https://doi.org/10.1016/S0377-2217(98)00099-X
Cited by solver guided-local-search.
watkins1992qlearning: C. J. C. H. Watkins and P. Dayan (1992). Q-learning. Machine Learning 8(3-4):279-292. https://doi.org/10.1007/BF00992698
Cited by solver q-learning-dispatching.
while2006faster: L. While, P. Hingston, L. Barone and S. Huband (2006). A faster algorithm for calculating hypervolume. IEEE Transactions on Evolutionary Computation 10(1):29-38. https://doi.org/10.1109/TEVC.2005.851275
Cited by method Hypervolume.
wilcoxon1945individual: F. Wilcoxon (1945). Individual comparisons by ranking methods. Biometrics Bulletin 1(6):80-83. https://doi.org/10.2307/3001968
Cited by method Wilcoxon signed-rank test.
williams1992simple: R. J. Williams (1992). Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning 8(3-4):229-256. https://doi.org/10.1007/BF00992696
Cited by solver reinforce-priority-policy.
wong2011points: B. Wong (2011). Points of view: Color blindness. Nature Methods 8(6):441. https://doi.org/10.1038/nmeth.1618
yamada1992genetic: T. Yamada and R. Nakano (1992). A genetic algorithm applicable to large-scale job-shop problems. In R. Männer and B. Manderick (eds.), Parallel Problem Solving from Nature 2, North-Holland, Amsterdam, 281-290.
Cited by suite orlib-job-shop.
yang2009cuckoo: X.-S. Yang and S. Deb (2009). Cuckoo search via Lévy flights. World Congress on Nature and Biologically Inspired Computing (NaBIC 2009), 210-214. https://doi.org/10.1109/NABIC.2009.5393690
Cited by solver cuckoo-search.
yang2009firefly: X.-S. Yang (2009). Firefly algorithms for multimodal optimization. Stochastic Algorithms: Foundations and Applications (SAGA 2009), Lecture Notes in Computer Science 5792:169-178. https://doi.org/10.1007/978-3-642-04944-6_14
Cited by solver firefly-algorithm.
yang2014firefly: X.-S. Yang (2014). Firefly algorithms. Nature-Inspired Optimization Algorithms, Elsevier, 111-127. https://doi.org/10.1016/B978-0-12-416743-8.00008-7
Cited by solver firefly-algorithm.
zaki2024cooperative: T. Zaki, Y. Zeiträg, R. Neves and J. R. Figueira (2024). A cooperative coevolutionary genetic programming hyper-heuristic for multi-objective makespan and cost optimization in cloud workflow scheduling. Computers & Operations Research 172:106805. https://doi.org/10.1016/j.cor.2024.106805
Cited by solver gp-hyper-heuristic.
zhang2007moead: Q. Zhang and H. Li (2007). MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation 11(6):712-731. https://doi.org/10.1109/TEVC.2007.892759
Cited by solver moea-d.
zhang2009jade: J. Zhang and A. C. Sanderson (2009). JADE: Adaptive differential evolution with optional external archive. IEEE Transactions on Evolutionary Computation 13(5):945-958. https://doi.org/10.1109/TEVC.2009.2014613
Cited by solver differential-evolution, solver lshade.
zhang2011semiconductor: Z. Zhang, L. Zheng, F. Hou and N. Li (2011). Semiconductor final test scheduling with Sarsa(λ, k) algorithm. European Journal of Operational Research 215(2):446-458. https://doi.org/10.1016/j.ejor.2011.05.052
Cited by solver sarsa-dispatching.
zhang2021surrogateassisted: F. Zhang, Y. Mei, S. Nguyen, M. Zhang and K. C. Tan (2021). Surrogate-assisted evolutionary multitask genetic programming for dynamic flexible job shop scheduling. IEEE Transactions on Evolutionary Computation 25(4):651-665. https://doi.org/10.1109/TEVC.2021.3065707
Cited by solver gp-hyper-heuristic.
zitzler1999multiobjective: E. Zitzler and L. Thiele (1999). Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 3(4):257-271. https://doi.org/10.1109/4235.797969
Cited by method Hypervolume.
zitzler2001spea2: E. Zitzler, M. Laumanns and L. Thiele (2001). SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-Report 103, Computer Engineering and Networks Laboratory (TIK), ETH Zurich. https://doi.org/10.3929/ethz-a-004284029
Cited by solver spea2.
zitzler2004indicatorbased: E. Zitzler and S. Künzli (2004). Indicator-based selection in multiobjective search. Parallel Problem Solving from Nature (PPSN VIII), Lecture Notes in Computer Science 3242:832-842. https://doi.org/10.1007/978-3-540-30217-9_84
Cited by solver ibea.