• Amorim, P., Costa, A., Almada-Lobo, B., 2013. Influence of consumer purchasing behaviour on the production planning of perishable food.OR Spectrum DOI 10.1007/s00291-013-0324-9.
  • Bianchi, L., Dorigo, M., Gambardella, L.M., Gutjahr, W.J., 2008. A survey on metaheuristics for stochastic combinatorial optimization. Natural Computing 8, 239287.
  • Costa, D., Silver, E., 1998. Tabu search when noise is present: an illustration in the context of cause and effect analysis. Journal of Heuristics 23, 523.
  • Dolan, E.D., More, J.J., 2002. Benchmarking optimization software with performance profiles. Mathematical Programming 91, 201213.
  • Festa, P., Resende, M., 2009. Hybrid grasp heuristics. In Abraham, A., Hassanien, A.E., Siarry, P., Engelbrecht, A. (eds) Foundations of Computational Intelligence, Vol. 3. Springer, Berlin and Heidelberg Studies in Computational Intelligence, Vol. 203, pp. 75100.
  • Festa, P., Resende, M., 2011. Grasp: basic components and enhancements. Telecommunication Systems 46, 253271.
  • Festa, P., Resende, M., 2013. Hybridizations of grasp with path-relinking. In Talbi, E.G. (ed.) Hybrid Metaheuristics. Springer, Berlin and Heidelberg Studies in Computational Intelligence, Vol. 434, pp. 135155.
  • Glover, F., Laguna, M., 1993. Tabu search. In Reeves, C. (ed.) Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publishing, Oxford, pp. 70141.
  • Gutjahr, W., 2003. A converging ACO algorithm for stochastic combinatorial optimization. In Albrecht, A., Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. Springer, Berlin and Heidelberg, Lecture Notes in Computer Science, Vol. 2827, pp. 1025.
  • Gutjahr, W.J., Strauss, C., Wagner, E., 2000. A stochastic branch-and-bound approach to activity crashing in project management. INFORMS Journal on Computing 12, 125135.
  • Haase, K., Kimms, A., 2000. Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of Production Economics 66, 159169.
  • Lokketangen, A., Woodruff, D.L., 1996. Progressive hedging and tabu search applied to mixed integer (0, 1) multistage stochastic programming. Journal of Heuristics 2, 2, 111128.
  • Meyr, H., 2002. Simultaneous lotsizing and scheduling on parallel machines. European Journal of Operational Research 139, 277292.
  • Resende, M.G., Ribeiro, C.C., Glover, F., Martin, R., 2010. Scatter search and path-relinking: fundamentals, advances, and applications. In Gendreau, M., Potvin, J.Y. (eds) Handbook of Metaheuristics. Springer, New York, International Series in Operations Research & Management Science, Vol. 146, pp. 87107.
  • Rockafellar, R., Wets, R., 1991. Scenarios and policy aggregation in optimization under uncertainty. Mathematics of Operations Research 16, 119147.
  • Watson, J.-P., Woodruff, D.L., 2010. Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems. Computational Management Science 8, 355370.
  • Zeng, R.Q., Basseur, M., Hao, J.K., 2013. Solving bi-objective flow shop problem with hybrid path relinking algorithm. Applied Soft Computing 13, 41184132.