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

DOI10.1016/j.cor.2012.08.017zbMath1349.90331DBLPjournals/cor/CondottaKMS13OpenAlexW2043270918WikidataQ59902330 ScholiaQ59902330MaRDI QIDQ340247

Alessandro Condotta, Sigrid Knust, Natalia V. Shakhlevich, Dimitri Meier

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.08.017

zbMATH Keywords

transportationschedulingtabu searchlower boundsbatching

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Integrated production and outbound distribution scheduling problems with job release dates and deadlines ⋮ Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation ⋮ Preemptive scheduling in a two-stage supply chain to minimize the makespan ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ A review on integrated scheduling and outbound vehicle routing problems ⋮ Solving the production transportation problem via a deterministic annealing neural network method ⋮ Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm

This page was built for publication: Tabu search and lower bounds for a combined production-transportation problem