Name
Abstract | ||
|---|---|---|
In this paper we consider the problem of minimizing material handling costs in manufacturing systems or warehousing facilities,
subject to constraints that restrict the start and end time of each production or picking/packaging activity, according to
pre-specified daily operational schedules and process planning information. The underlying decision problem is modeled using
an integer programming formulation similar to the vehicle routing problem with time windows. Since the problem isNP-complete, we develop an efficient heuristic to solve it in short processing time. The method, called penalty-based heuristic,
allows routes to be constructed by exploiting the tradeoff between material handling and resource starvation costs. The steps
of the method are illustrated via a comprehensive example. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/BF02944149 | Operational Research |
Keywords | DocType | Volume |
manufacturing,material handling systems,warehousing,vehicle routing | Journal | 4 |
Issue | ISSN | Citations |
3 | 1866-1505 | 1 |
PageRank | References | Authors |
0.39 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| George Ioannou | 1 | 106 | 11.99 |
| Manolis N. Kritikos | 2 | 9 | 2.59 |