Strategic marketing, production, and distribution planning of an integrated manufacturing system

Production Scheduling;Distribution;CIM;production

Dataset of the Refrigerator Case: design of closed loop supply chains

This paper contains the dataset for the refrigerator case concerning the design of a production and return network for refrigerators. Section 1 emphasises the major changes to the problem structure and assumptions used by Umeda et al. (1999). Section 2 contains the parameter settings. Section 3 contains the distance matrix for all locations.supply chain management;reverse logistics;facility location;network design;product design

Design of Closed Loop Supply Chains

Increased concern for the environment has lead to new techniques to design products and supply chains that are both economically and ecologically feasible. This paper deals with the product - and corresponding supply chain design for a refrigerator. Literature study shows that there are many models to support product design and logistics separately, but not in an integrated way. In our research we develop quantitative modelling to support an optimal design structure of a product, i.e. modularity, repairability, recyclability, as well as the optimal locations and goods flows allocation in the logistics system. Environmental impacts are measured by energy and waste. Economic costs are modelled as linear functions of volumes with a fixed set-up component for facilities. We apply this model using real life R&D data of a Japanese consumer electronics company. The model is run for different scenarios using different parameter settings such as centralised versus decentralised logistics, alternative product designs, varying return quality and quantity, and potential environmental legislation based on producer responsibility.supply chain management;reverse logistics;facility location;network design;product design

Managing high-end ex-demonstration product returns

Some manufacturers demonstrate their products so that customers can gain experience before making a purchase. We present a novel application of a closed-loop supply chain where product returns from demonstrations of high-end IT equipment are substantial and the major delay in the system is due to the long demonstration time at the client sites. In addition, the product lifecycle is short and the value erodes rapidly over time, with steep drops in the resale revenue when new product generations are introduced. We present a finite lifecycle model that captures the key trade-offs in this environment, that is, either to reuse a collected ex-demo product for a next demonstration or to salvage its residual value in the secondary market and use a new product to satisfy the next demo request. We derive two cost/revenue signals that enable us to distinguish between fast and slow value erosion. We show that the fast/slow erosion decision is dynamic and depends on the rate of value erosion and the length of the demonstration time. We analyze the optimal demo pool strategies and show that in the case of fast erosion it may be better to postpone reuse activities until later in the lifecycle. We illustrate our model using empirical data from a large IT manufacturer and formulate several guidelines so as to better manage high value ex-demonstration product returns

A survey of algorithms for the single machine total weighted tardiness scheduling problem

AbstractThis paper surveys algorithms for the problem of scheduling jobs on a single machine to minimize total weighted tardiness. Special attention is given to two dynamic programming and four branch and bound algorithms. The dynamic programming algorithms both use the same recursion defined on sets of jobs, but they generate the sets in lexicographic order and cardinality order respectively. Two of the branch and bound algorithms use the quickly computed but possibly rather weak lower bounds obtained from linear and exponential functions of completion times problems. These algorithms rely heavily on dominance rules to restrict the search. The other two branch and bound algorithms use lower bounds obtained from the Lagrangean relaxation of machine capacity constraints and from dynamic programming state-space relaxation. They invest a substantial amount of computation time at each node of the search tree in an attempt to generate tight lower bounds and thereby generate only small search trees. A computational comparison of all these algorithms on problems with up to 50 jobs is given

A Paradigm Shift: Supply Chain Collaboration and Competition in and between Europe’s Chemical Clusters

With the attention of the chemical industry focused on exploiting the low cost feedstocks in the Middle East and the growth markets of Brazil, Russia, India, China and South East Asia, this report provides a timely reminder to policy makers, chemical companies and logistics service providers of the significant opportunities for improving business potential in Europe’s chemical clusters. Europe is still the largest, most sophisticated global market for chemical products, with a well developed, efficient, highly productive asset base, sound infrastructure, leading edge research and development and significant purchasing power. Provided these advantages are sustained, including continued attention to asset maintenance and operational and supply chain improvements, Europe can remain a competitive force in the global market place, despite what the doom-mongers may say to the contrary. ..

Exact and approximation algorithms for the operational fixed interval scheduling problem

The Operational Fixed Interval Scheduling Problem (OFISP) is characterized as the problem of scheduling a number of jobs, each with a fixed starting time, a fixed finishing time, a priority index, and a job class. The objective is to find an assignment of jobs to machines with maximal total priority. The problem is complicated by the restrictions that: (i) each machine can handle only one job at a time, (ii) each machine can handle only jobs from a prespecified subset of all possible job classes, and (iii) preemption is not allowed. It follows from the above that OFISP has both the character of a job scheduling problem and the character of an assignment problem. In this paper we discuss the occurrence of the problem in practice, and we present newly developed exact and approximation algorithms for solving OFISP. Finally, some computational results are shown