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...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 259; číslo 3; s. 906 - 916 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
16.06.2017
|
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | •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 |