Integrated production and distribution scheduling with a perishable product

•Mathematical programming formulation solvable for small problems.•Route first, cluster second approach using makespan compression.•Bounds on routes and cost developed.•Heuristics used for realistic sized problems. This research focuses on the practical problem of a perishable product that must be p...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 259; no. 3; pp. 906 - 916
Main Authors: Devapriya, Priyantha, Ferrell, William, Geismar, Neil
Format: Journal Article
Language:English
Published: Elsevier B.V 16.06.2017
Subjects:
Genetic algorithms
Integrated scheduling
Logistics
Memetic algorithms
Production and distribution
Memetic algorithms
Integrated scheduling
Production and distribution
Genetic algorithms
Logistics
ISSN:0377-2217, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•Mathematical programming formulation solvable for small problems.•Route first, cluster second approach using makespan compression.•Bounds on routes and cost developed.•Heuristics used for realistic sized problems. This research focuses on the practical problem of a perishable product that must be produced and distributed before it becomes unusable but at minimum cost. The problem has some features of the integrated production and distribution scheduling problem in that we seek to determine the fleet size and the trucks’ routes subject to a planning horizon constraint. In particular, this research differs because the product has a limited lifetime, the total demand must be satisfied within a planning horizon, multiple trucks can be used, and the production schedule and the distribution sequence are considered. A mixed integer programming model is formulated to solve the problem and, then, heuristics based on evolutionary algorithms are provided to resolve the models.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2016.09.019