1,721,035 research outputs found

    Utilizzo del modulo MRP per la pianificazione della produzione nel caso di forniture in Consignment Stock

    No full text
    Il Consignment Stock è una metodologia di integrazione logistica mirante alla minimizzazione delle scorte in ottica di filiera, basata su una stretta collaborazione e su un regolare scambio informativo fra le aziende coinvolte. Considerando il crescente interesse che il Consignment Stock sta generando in campo industriale, l'obiettivo di questo lavoro consiste nell'individuazione e nella formalizzazione dei fattori che determinano il successo di tale strategia. La parte centrale del lavoro consiste nell'ideazione di una modifica di carattere operativo, da apportare al modulo MRP standard, per consentire un più semplice e performante gestione della produzione nel caso di forniture in Consignment Stock. A chiarimento del metodo proposto, viene infine proposto un esempio numerico a carattere illustrativo

    An innovative inbound logistic strategy for the two wheels vehicles market

    No full text
    In the automotive industry, Just in Time Delivery is generally regarded as the primary way to reduce inventory and to avoid delays. However, when demand is variable and/or seasonal as for the two wheels vehicles market, JITD presents several drawbacks and cannot be effectively implemented. Considering these issues, the present paper proposes an innovative inbound logistic strategy, which is based on Vendor Managed Inventory coupled with Consignment Stock. At present, this approach is being implemented in an important Italian district for the production of two wheels vehicles. The technical problems that have been successfully addressed and the preliminary results of the industrial application are described in details in the pape

    Computer simulation for the management of parking areas in a ferry terminal

    No full text
    In this article the problem of managing car/passengers parking area in port terminals is analyzed. Ferry terminals have often restricted parking areas for loading vehicles. This is the reason why the departures of the ferries are scheduled opportunely allocating loading areas dynamically. When one or more departure delays occur, the assessment of the required parking areas becomes problematic. To support the manager in this hard and critical task, a computer simulation-based software is proposed to improve parking areas use and responsiveness during arrival, parking and loading activities. The simulation model considers the main characteristics of the parking area (dimensions, layout, number of piers), ferry traffic and capacity, time of departure, etc.. The same software is also used to analyze and evaluate a potential alternative re-designed layout.. In particular, three re-designed parking area layouts are evaluated with the implemented simulating software. For this aim, three suitable performance indexes for evaluating layout efficiency are established. The proposed simulating model and results are described presenting an actually applied case for a medium port in the Mediterranean sea

    Going Beyond Counting First Authors in Author Co-citation Analysis

    Full text link
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed

    A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness

    No full text
    This paper presents a new heuristic for solving the flowshop scheduling problemthat aims to minimize makespan and maximize tardiness. The algorithm is ableto take into account the aforementioned performance measures, finding a set ofnon-dominated solutions representing the Pareto front. This method is based onthe integration of two different techniques: a multi-criteria decision-makingmethod and a constructive heuristic procedure developed for makespanminimization in flowshop scheduling problems. In particular, the technique fororder preference by similarity of ideal solution (TOPSIS) algorithm is integratedwith the Nawaz–Enscore–Ham (NEH) heuristic to generate a set of potentialscheduling solutions. To assess the proposed heuristic’s performance, comparisonwith the best performing multi-objective genetic local search (MOGLS) algorithmproposed in literature is carried out. The test is executed on a large number ofrandom problems characterized by different numbers of machines and jobs.The results show that the new heuristic frequently exceeds the MOGLS results interms of both non-dominated solutions, set quality and computational time.In particular, the improvement becomes more and more significant as the numberof jobs in the problem increases
    corecore