Fetching the paper…
Reading the bibliography…
Many optimization techniques evaluate solutions consecutively, where the next candidate for evaluation is determined by the results of previous evaluations.
Probabilistic and parametric learning methods for the job shop scheduling problem
Crowston, W., Glover, F., Thompson, G., and Trawick, J. (1964) · 1964
Earlier work this paper cites.
Probability dominance in random outcomes
Wrather, C. and Yu, P. L. (1982) · 1982
Earlier work this paper cites.
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · 1986
Earlier work this paper cites.
Tabu Search - Part I
Glover, F. (1989) · 1989
Earlier work this paper cites.
OR-library: Distributing test problems by electronic mail
Beasley, J. E. (1990) · 1990
Earlier work this paper cites.
Tabu Search: A Tutorial
Glover, F. (1990) · 1990
Earlier work this paper cites.
Tabu search
Glover, F. and Laguna, M. (1993) · 1993
Earlier work this paper cites.
Benchmarks for basic scheduling problems
Taillard, E. (1993) · 1993
Earlier work this paper cites.
The job-shop scheduling problem: Conventional and new solution techniques
Blazewicz, J., Domschke, W., and Pesch, E. (1996) · 1996
Earlier work this paper cites.
Bootstrap confidence intervals
DiCiccio, T. J. and Efron, B. (1996) · 1996
Earlier work this paper cites.
A fast tabu search algorithm for the job-shop problem
Nowicki, E. and Smutnicki, C. (1996) · 1996
Earlier work this paper cites.
Tabu Search
Glover, F. and Laguna, M. (1997) · 1997
Earlier work this paper cites.
Benchmarks for shop scheduling problems
Demirkol, E., Mehta, S., and Uzsoy, R. (1998) · 1998
Earlier work this paper cites.
Deterministic job shop scheduling: Past, present and future
Jain, A. and Meeran, S. (1999) · 1999
Earlier work this paper cites.
The method of global equilibrium search
Shilo, V. (1999) · 1999
Earlier work this paper cites.
Toward an understanding of local search cost in job-shop scheduling
Watson, J.-P., Beck, J., Howe, A., and Whitley, L. (2001) · 2001
Earlier work this paper cites.
Logistic regression
Agresti, A. (2002) · 2002
Earlier work this paper cites.
A racing algorithm for configuring metaheuristics
Birattari, M., Stützle, T., Paquete, L., and Varrentrapp, K. (2002) · 2002
Cited alongside, same era.
Fine-tuning of algorithms using fractional experimental designs and local search
Adenso-Díaz, B. and Laguna, M. (2006) · 2006
Cited alongside, same era.
An algorithm for the job shop scheduling problem based on global equilibrium search techniques
Pardalos, P. and Shylo, O. (2006) · 2006
Cited alongside, same era.
How the landscape of random job shop scheduling instances depends on the ratio of jobs to machines
Streeter, J. and Smith, S. (2006) · 2006
Cited alongside, same era.
SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT
Xu, L., Hutter, F., Hoos, H. H., and Leyton-Brown, K. (2008) · 2007
Cited alongside, same era.
Global equilibrium search applied to the unconstrained binary quadratic optimization problem
Learning to search in branch and bound algorithms
He, H., Daume III, H., and Eisner, J. M. (2014) · 2014
Later among the works it cites.
A tabu search/path relinking algorithm to solve the job shop scheduling problem
Peng, B., Lü, Z., and Cheng, T. (2015) · 2015
Later among the works it cites.
Failure-directed search for constraint-based scheduling
Vilím, P., Laborie, P., and Shaw, P. (2015) · 2015
Later among the works it cites.
Learning to learn by gradient descent by gradient descent
Andrychowicz, M., Denil, M., Gomez, S., Hoffman, M. W., Pfau, D., Schaul, T., and de Freitas, N. (2016) · 2016
Later among the works it cites.
ASlib: A benchmark library for algorithm selection
Bischl, B., Kerschke, P., Kotthoff, L., Lindauer, M., Malitsky, Y., Fréchette, A., Hoos, H., Hutter, F., Leyton-Brown, K., Tierney, K., et al. (2016) · 2016
Later among the works it cites.
DASH: Dynamic approach for switching heuristics
Di Liberto, G., Kadioglu, S., Leo, K., and Malitsky, Y. (2016) · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Pardalos, P. M., Prokopyev, O. A., Shylo, O. V., and Shylo, V. P. (2008) · 2008
Cited alongside, same era.
Solving weighted max-sat via global equilibrium search
Shylo, O. V., Prokopyev, O. A., and Shylo, V. P. (2008) · 2008
Cited alongside, same era.
A very fast TS/SA algorithm for the job shop scheduling problem
Zhang, C. Y., Li, P., Rao, Y., and Guan, Z. (2008) · 2008
Cited alongside, same era.
ParamILS: an automatic algorithm configuration framework
Hutter, F., Hoos, H. H., Leyton-Brown, K., and Stützle, T. (2009) · 2009
Cited alongside, same era.
Maximum likelihood techniques: An overview
Kleinbaum, D. G. and Klein, M. (2010) · 2010
Cited alongside, same era.
Solving the maxcut problem by the global equilibrium search
Shylo, V. P. and Shylo, O. V. (2010) · 2010
Cited alongside, same era.
A probing algorithm for minlp with failure prediction by svm
Nannicini, G., Belotti, P., Lee, J., Linderoth, J., Margot, F., and Wächter, A. (2011) · 2011
Cited alongside, same era.
Later among the works it cites.
Learning to branch in mixed integer programming
Khalil, E. B., Le Bodic, P., Song, L., Nemhauser, G. L., and Dilkina, B. N. (2016) · 2016
Later among the works it cites.
Mixed integer programming models for job shop scheduling: a computational analysis
Ku, W.-Y. and Beck, J. C. (2016) · 2016
Later among the works it cites.
A machine learning-based approximation of strong branching
Alvarez, A. M., Louveaux, Q., and Wehenkel, L. (2017) · 2017
Later among the works it cites.
Random sampling and machine learning to understand good decompositions
Basso, S., Ceselli, A., and Tettamanzi, A. (2017) · 2017
Later among the works it cites.
Comments on: On learning and branching: a survey
Dilkina, B., Khalil, E. B., and Nemhauser, G. L. (2017) · 2017
Later among the works it cites.
Learning when to use a decomposition
Kruber, M., Lübbecke, M. E., and Parmentier, A. (2017) · 2017
Later among the works it cites.
On learning and branching: a survey
Lodi, A. and Zarpellon, G. (2017) · 2017
Later among the works it cites.
Comments on: On learning and branching: a survey
Louveaux, Q. (2017) · 2017
Later among the works it cites.
Experimental data: Boosting binary optimization via binary classification
Shylo, O. (2018a) · 2018
Closest in time.
Job shop scheduling webpage, http://optimizizer.com/jobshop.php (last accessed on 2018-10-23)
Shylo, O. V. (2018b) · 2018
Closest in time.