Tabu search and lower bounds for a combined production-transportation problem

Condotta, A, Knust, S, Meier, D et al. (1 more author) (2012) Tabu search and lower bounds for a combined production-transportation problem. Computers and Operations Research, 40 (3). 886 - 900. ISSN 0305-0548

Abstract

Metadata

Authors/Creators:
  • Condotta, A
  • Knust, S
  • Meier, D
  • Shakhlevich, NV
Copyright, Publisher and Additional Information: (c) 2012, Elsevier. NOTICE: this is the author’s version of a work that was accepted for publication in Computers and Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers and Operations Research, 40, 3, 2012. 10.1016/j.cor.2012.08.017
Keywords: Scheduling; Transportation; Batching; Tabu search; Lower bounds
Dates:
  • Published: 15 September 2012
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 16 Jun 2014 11:31
Last Modified: 19 Jul 2017 06:47
Published Version: http://dx.doi.org/10.1016/j.cor.2012.08.017
Status: Published
Publisher: Elsevier
Identification Number: https://doi.org/10.1016/j.cor.2012.08.017

Share / Export

Statistics