8,200 research outputs found

    Production and Delivery Batch Scheduling with Multiple Due Dates to Minimize Total Cost

    Get PDF
    This paper addresses an integrated production and delivery batch scheduling problem for a make-to-order environment over daily time period, where the holding costs of in-process and completed parts at a supplier location and of completed parts at a manufacturer location are distinguished. All orders of parts with different due dates from the manufacturer arrive at the same time. The parts are produced in production batches and subsequently the completed parts are delivered in delivery batches using a capacitated vehicle in order to be received at the respective due dates. This study was aimed at finding an integrated schedule of production and delivery batches so as to meet the due date at minimum total cost consisting of the corresponding holding cost and delivery cost. The holding cost is a derivation of the so-called actual flow time (AFT), while the delivery cost is assumed to be proportional to the number of deliveries. The problems can be formulated as an integer non-linear programming model, and the global optimal solution can be obtained using optimization software. A heuristic algorithm is proposed to cope with the computational time problem using software. The numerical experiences show that the proposed algorithm yields near global optimal solutions

    Tracking Chart 2010 Yee Tung Garment Co, Ltd

    Get PDF
    This document is part of a digital collection provided by the Martin P. Catherwood Library, ILR School, Cornell University, pertaining to the effects of globalization on the workplace worldwide. Special emphasis is placed on labor rights, working conditions, labor market changes, and union organizing.FLA_2010TrackingChart_YeeTungGarmentCo_Jordan.pdf: 98 downloads, before Oct. 1, 2020

    Modeling and solving the multi-period inventory routing problem with constant demand rates

    Get PDF
    The inventory routing problem (IRP) is one of the challenging optimization problems in supply chain logistics. It combines inventory control and vehicle routing optimization. The main purpose of the IRP is to determine optimal delivery times and quantities to be delivered to customers, as well as optimal vehicle routes to distribute these quantities. The IRP is an underlying logistical optimization problem for supply chains implementing vendor-managed inventory (VMI) policies, in which the supplier takes responsibility for the management of the customers' inventory. In this paper, we consider a multi-period inventory routing problem assuming constant demand rates (MP-CIRP). The proposed model is formulated as a linear mixed-integer program and solved with a Lagrangian relaxation method. The solution obtained by the Lagrangian relaxation method is then used to generate a close to optimal feasible solution of the MP-CIRP by solving a series of assignment problems. The numerical experiments carried out so far show that the proposed Lagrangian relaxation approach nds quite good solutions for the MP-CIRP and in reasonable computation times

    Supply chain management and the Romanian transition

    Get PDF
    The purpose of this paper is to perform a systemic analysis of the Supply Chain Management, and to show what are the essential aspects of such a complex process. Actually, it is an integral perspective of intra- and interorganizational management activities aiming at the optimization of all important tangible and intangible fluxes and forces acting in a multifield framework. In the same time, we are looking at the Romanian transition and show how such a new perspective can be applied to the business environment. The analysis is challenging, since Romania is in a deep change process from a centrally planned economy toward a free market economy.management, supply chain management, system analysis, transition economy.

    Models for supply chain negotiation in collaborative relationships

    Get PDF
    Nowadays, firms are increasingly building collaborative relationships with their partners in order to improve the global performance of the supply chain in which they are involved. Such collaborative relationships require information exchange or share and negotiation. In this paper, we first formalize some practices of collaboration from case studies of the aeronautical area then suggest some models for negotiation, allowing a supply chain member to publish hidden constraints and share risks/costs in order to achieve a win-win situation

    A demand-driven approach for a multi-agent system in Supply Chain Management

    Get PDF
    This paper presents the architecture of a multi-agent decision support system for Supply Chain Management (SCM) which has been designed to compete in the TAC SCM game. The behaviour of the system is demand-driven and the agents plan, predict, and react dynamically to changes in the market. The main strength of the system lies in the ability of the Demand agent to predict customer winning bid prices - the highest prices the agent can offer customers and still obtain their orders. This paper investigates the effect of the ability to predict customer order prices on the overall performance of the system. Four strategies are proposed and compared for predicting such prices. The experimental results reveal which strategies are better and show that there is a correlation between the accuracy of the models' predictions and the overall system performance: the more accurate the prediction of customer order prices, the higher the profit. © 2010 Springer-Verlag Berlin Heidelberg

    An agent-based dynamic information network for supply chain management

    Get PDF
    One of the main research issues in supply chain management is to improve the global efficiency of supply chains. However, the improvement efforts often fail because supply chains are complex, are subject to frequent changes, and collaboration and information sharing in the supply chains are often infeasible. This paper presents a practical collaboration framework for supply chain management wherein multi-agent systems form dynamic information networks and coordinate their production and order planning according to synchronized estimation of market demands. In the framework, agents employ an iterative relaxation contract net protocol to find the most desirable suppliers by using data envelopment analysis. Furthermore, the chain of buyers and suppliers, from the end markets to raw material suppliers, form dynamic information networks for synchronized planning. This paper presents an agent-based dynamic information network for supply chain management and discusses the associated pros and cons

    Production and Delivery Batch Scheduling with Multiple Due Dates to Minimize Total Cost

    Full text link
    • 

    corecore