Name
Abstract | ||
|---|---|---|
In this paper we consider a new transportation model, called the loader problem, which is frequently encountered by third-party logistics service providers in practice. It is a tactical staff-planning problem with the objective of minimizing the total labour cost of staffing a sufficient number of loaders on a given fleet of trucks that serve a given set of customer sites. We formulate the problem as an integer program and show that it is strongly NP-hard. We then consider two special cases of the loader problem that occur in certain practical situations, and propose polynomial and pseudo-polynomial time algorithms for solving these cases. We also propose a linear programming relaxation-based random rounding algorithm for the general problem and report the computational results of the algorithm. Journal of the Operational Research Society (2010) 61, 840-848. doi:10.1057/jors.2009.55 |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1057/jors.2009.55 | JORS |
Keywords | Field | DocType |
algorithms,integer programming,loader problem,logistics,np-hard,management science,operations research,production,information technology,information systems,communications technology,operational research,computer science,project management,marketing,reliability,forecasting,inventory,location,scheduling,investment | Polynomial,Computer science,Algorithm,Operations research,Rounding,Service provider,Integer programming,Function problem,Cutting stock problem,Loader,Linear programming relaxation,Operations management | Journal |
Volume | Issue | ISSN |
61 | 5 | 14769360 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tang | 1 | 20 | 2.93 |
| F. Chen | 2 | 89 | 6.19 |
| T.C. Edwin Cheng | 3 | 3906 | 256.62 |
| C. T. Daniel Ng | 4 | 331 | 20.91 |
| Zhi-Long Chen | 5 | 414 | 26.32 |