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

DOI10.1016/J.COR.2012.08.017MaRDI QIDQ340247zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Alessandro Condotta, Sigrid Knust, Dimitri Meier, N. V. Shakhlevich

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

lower boundsschedulingtransportationtabu searchbatching

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2114493
• A Lagrangian based branch-and-bound algorithm for production-transportation problems
• Tabu search with path relinking for an integrated production-distribution problem
• A tabu search procedure for coordinating production, inventory and distribution routing problems
• Solving transportation problems with nonlinear side constraints with tabu search
• A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST
• A relaxation-strategy-based modification branch-and-bound algorithm for solving a class of transportation-production problems
• A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
• scientific article; zbMATH DE number 2209656
• scientific article; zbMATH DE number 194389

Cited in

(10)

• A general purpose exact solution method for mixed integer concave minimization problems
• Solving the production transportation problem via a deterministic annealing neural network method
• A review on integrated scheduling and outbound vehicle routing problems
• Integrated production and outbound distribution scheduling problems with job release dates and deadlines
• Tabu search with path relinking for an integrated production-distribution problem
• Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation
• MIP formulations and heuristics for two-level production-transportation problems
• Preemptive scheduling in a two-stage supply chain to minimize the makespan
• Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm
• Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340247)