Recursos de colección

ORBi Open Repository and Bibliography (327.254 recursos)

In may 2007, the ULg's Administrative Board (joined in June 2007 by the FUSAGx) decided to create an institutional repository and defined a strong institutional self-archiving policy to increase the visibility, accessibility and impact of the University's publications (Board's decision). This decision led to the official launch, in November 2008, of the ORBi platform including both the Academic Bibliography and the Institutional Repository of the Wallonia-Europe University Academy.

Business & economic sciences => Production, distribution & supply chain management

Mostrando recursos 1 - 17 de 17

  1. Neighborhood Search Algorithms for Multi-Trip Vehicle Routing

    François, Véronique
    Think about the lines of trucks we overtake on highways. Each of these trucks is performing a journey that may include several delivery or pickup operations before getting to a depot. And each of these journeys is generally determined through a large-scale planning process that concerns a fleet of vehicles. While establishing such a plan, transport operators organize vehicle journeys with an underlying objective such as the minimization of the transportation cost or the maximization of the service level. During the planning process, at least the following decisions have to be made: which customers are going to be visited by...

  2. Optimiser la logistique: Slogan ou réalité?

    Crama, Yves

  3. A discussion of production planning approaches in the process industry

    Crama, Yves; Pochet, Yves; Wera, Yannic
    In this paper, we discuss the literature on production planning approaches in the process industry. Our contribution is to underline the differences, as well as the similarities, between issues and models arising in process environments and better known situations arising in discrete manufacturing, and to explain how these features affect the optimization models used in production planning. We present an overview of the distinctive features of process industries, as they relate to production planning issues. We discuss some of the difficulties encountered with the implementation of classical flow control techniques, like MRP or JIT, and we describe how various authors...

  4. Recherche opérationnelle et gestion de la production

    Crama, Yves; Dupont, Lionel; Finke, Gerd
    Depuis leurs origines, la recherche opérationnelle et la gestion de la production entretiennent des relations privilégiées. Historiquement, la gestion de la production et les domaines connexes de la logistique industrielle ont d'ailleurs rapidement supplanté la gestion des opérations militaires comme champ d’action principal et, simultanément, comme catalyseur du développement de la recherche opérationnelle. L'article offre un très bref aperçu des applications de la recherche opérationnelle en gestion de la production. Il est organisé autour de trois thèmes principaux, à savoir: planification de la production et programmation mathématique, gestion des stocks et conception de systèmes.

  5. Minimizing the number of tool switches on a flexible machine

    Crama, Yves; Kolen, Anton W.J.; Oerlemans, Alwin G.; Spieksma, Frits C.R.
    Peer reviewed

  6. Adaptive large neighborhood search for multi-trip vehicle routing with time windows

    François, Véronique; Arda, Yasemin; Crama, Yves
    We consider a multi-trip vehicle routing problem with time windows (MTVRPTW), in which each vehicle can perform several trips during its working shift. This problem is especially relevant in the context of city logistics. Heuristic solution methods for multi-trip vehicle routing problems often separate routing and assignment phases in order to create trips and then assign them to the available vehicles. We show that this approach is outperformed by an integrated solution method in the presence of time windows. We use an automatic configuration tool to obtain efficient and contextualized implementations of our solution methods. We provide suitable instances for the...

  7. Instances for the Multi-Trip Vehicle Routing Problem with Time Windows

    François, Véronique; Arda, Yasemin
    Instance generator and instance files for the Multi-Trip Vehicle Routing Problem with Time Windows: the folder contains an instance generator usable in a web browser (no installation required), instance files (.txt) and a description of the problem and instance creation process (.pdf).

  8. Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015)


    Peer reviewed

  9. Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015)


    Peer reviewed

  10. Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015)


    Peer reviewed

  11. Fuzzy-Logic Controlled Genetic Algorithm for the Rail-Freight Crew-Scheduling Problem

    Khmeleva, E.; Hopgood, Adrian; Tipi, L.; Shahidan, M.
    Peer reviewed

  12. Etude socio-économique du projet de TGV FRET Liege Carex

    Lord-Tarte, E; Condé, Gilles; Devillet, Guénaël

  13. Stochastic Inventory Routing for Perishable Products

    Crama, Yves; Rezaei Sadrabadi, Mahmood; Savelsbergh, Martin; Van Woensel, Tom
    Peer reviewed

  14. A column generation approach to job grouping for flexible manufacturing systems

    Crama, Yves; Oerlemans, Alwin G.
    Peer reviewed

  15. Optimization of the service start time for an elementary shortest path problem with time windows

    Küçükaydın, Hande; Arda, Yasemin; Crama, Yves
    We investigate an elementary shortest path problem with resource constraints where a single capacitated vehicle, initially located at a depot, must serve a set of customers while respecting their individual time windows. When the vehicle visits a customer, it delivers the customer's demand and collects a revenue in return for the delivery. The vehicle can start its trip at any desired time. The transportation cost is a function of both the total distance traveled and the duration of the assigned trip. The objective is to determine the service start time from the depot, the subset of customers to be served, and the trip to be performed so as...

  16. Statistically Bundled Shewhart Control Charts for Monitoring Delivery Chains Systems

    Foster, Earnest; Faraz, Alireza; Heuchenne, Cédric
    Peer reviewed

  17. The complexity of scheduling short tasks with few starting times

    Crama, Yves; Spieksma, Frits C.R.
    The following problem is proved to be NP-complete: given n tasks, such that each task has processing time \tau=2, and has no more than k=3 possible starting times, does there exist a feasible schedule for these tasks on a single processor? This result establishes a sharp borderline between NP-complete and polynomially solvable versions of this problem with respect to the parameters \tau and k.

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.