| Titre : | The loader problem : formulation, complexity and algorithms (2010) |
| Auteurs : | G. Tang, Auteur ; F. Chen, Auteur ; Cheng, T. C. E., Auteur |
| Type de document : | Article : texte imprimé |
| Dans : | Journal of the operational research society (JORS) (Vol. 61 N° 5, Mai 2010) |
| Article en page(s) : | pp. 840–848 |
| Note générale : | Recherche opérationnelle |
| Langues : | Anglais |
| Index. décimale : | 001.424 |
| Tags : | Loader problem Integer programming Logistics NP-hard Algorithms |
| Résumé : | 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. |
| DEWEY : | 001.424 |
| ISSN : | 0361-5682 |
| En ligne : | http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200955a.html |
