Documents disponibles écrits par cet auteur

Berth and quay crane allocation: a moldable task scheduling model / Blazewicz, J. in Journal of the operational research society (JORS), Vol. 62 N° 7 (Juillet 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 7 (Juillet 2011) . - pp. 1189–1197 Titre : Berth and quay crane allocation: a moldable task scheduling model Type de document : texte imprimé Auteurs : Blazewicz, J., Auteur ; Cheng, T. C. E., Auteur ; Machowiak, M., Auteur Année de publication : 2011 Article en page(s) : pp. 1189–1197 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Berth  allocation  Guay  crane  allocation  Moldable  task  Resource  allocation  Parallel  computing Index. décimale : 001.424 Résumé : We study the problem of allocating berths to incoming ships and assigning the necessary quay cranes to the ships at a port container terminal. We formulate the problem as the moldable task scheduling problem by considering the tasks as ships and processors as quay cranes assigned to the ships based on the observation that the berthing duration of a ship depends on the number of quay cranes allocated to it. In the model, the processing speed of a task is considered to be a non-linear function of the number of processors allocated to it. We present a suboptimal algorithm that obtains a feasible solution to the discrete version of the problem from the continuous version, that is, where the tasks may require fractional quantities of the resources. We conducted computational experiments to evaluate the performance of the algorithm. The computational results show that the average behaviour of the algorithm is very good. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n7/abs/jors201054a.html [article] Berth and quay crane allocation: a moldable task scheduling model [texte imprimé] / Blazewicz, J., Auteur ; Cheng, T. C. E., Auteur ; Machowiak, M., Auteur . - 2011 . - pp. 1189–1197. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 7 (Juillet 2011) . - pp. 1189–1197 Mots-clés : Berth  allocation  Guay  crane  allocation  Moldable  task  Resource  allocation  Parallel  computing Index. décimale : 001.424 Résumé : We study the problem of allocating berths to incoming ships and assigning the necessary quay cranes to the ships at a port container terminal. We formulate the problem as the moldable task scheduling problem by considering the tasks as ships and processors as quay cranes assigned to the ships based on the observation that the berthing duration of a ship depends on the number of quay cranes allocated to it. In the model, the processing speed of a task is considered to be a non-linear function of the number of processors allocated to it. We present a suboptimal algorithm that obtains a feasible solution to the discrete version of the problem from the continuous version, that is, where the tasks may require fractional quantities of the resources. We conducted computational experiments to evaluate the performance of the algorithm. The computational results show that the average behaviour of the algorithm is very good. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n7/abs/jors201054a.html

The loader problem / G. Tang in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 840–848 Titre : The loader problem : formulation, complexity and algorithms Type de document : texte imprimé Auteurs : G. Tang, Auteur ; F. Chen, Auteur ; Cheng, T. C. E., Auteur Année de publication : 2010 Article en page(s) : pp. 840–848 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Loader  problem  Integer  programming  Logistics  NP-hard  Algorithms Index. décimale : 001.424 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 [article] The loader problem : formulation, complexity and algorithms [texte imprimé] / G. Tang, Auteur ; F. Chen, Auteur ; Cheng, T. C. E., Auteur . - 2010 . - pp. 840–848. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 840–848 Mots-clés : Loader  problem  Integer  programming  Logistics  NP-hard  Algorithms Index. décimale : 001.424 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