Hierarchical production control for a flow shop with dynamic setup changes and random machine breakdowns

In this paper, we study a manufacturing system consisting of two machines separated by two intermediate buffers, and capable of producing two different products. Each product requires a constant processing time on each of the machines. Each machine requires a constant non-negligible setup change time from one product to the other. The demand rate for each product is considered to be piecewise constant. Each machine undergoes failure and repair. The time-to-failure and time-to-repair are exponentially distributed random variables. The setup change and processing operations are resumable. We model our system as a continuous time, continuous flow process. An optimal control problem is formulated for the system to minimize the total expected discounted cost over an infinite horizon. To determine the optimal control policy structure, a discrete version of the problem is solved numerically using a dynamic programming formulation with a piecewise linear penalty function. A real-time control algorithm is then developed with the objective of maintaining low work-in-process inventory and keeping the production close to the demand. The algorithm uses a hierarchical control structure to generate the loading times for each product on each machine in real time and to respond to random disruptions in the system. The system is simulated using this algorithm to study its performance. The performance of the algorithm is also compared to alternative policies.     

Concurrent optimal allocation of distributed manufacturing resources using extended Teaching-Learning-Based Optimization

The optimal allocation of distributed manufacturing resources is a challenging task for supply chain deployment in the current competitive and dynamic manufacturing environments, and is characterised by multiple objectives including time, cost, quality and risk that require simultaneous considerations. This paper presents an improved variant of the Teaching-Learning-Based Optimisation (TLBO) algorithm to concurrently evaluate, select and sequence the candidate distributed manufacturing resources allocated to subtasks comprising the supply chain, while dealing with the trade-offs among multiple objectives. Several algorithm-specific improvements are suggested to extend the standard form of TLBO algorithm, which is only well suited for the one-dimensional continuous numerical optimisation problem well, to solve the two-dimensional (i.e. both resource selection and resource sequencing) discrete combinatorial optimisation problem for concurrent allocation of distributed manufacturing resources through a focused trade-off within the constrained set of Pareto optimal solutions. The experimental simulation results showed that the proposed approach can obtain a better manufacturing resource allocation plan than the current standard meta-heuristic algorithms such as Genetic Algorithm, Particle Swarm Optimisation and Harmony Search. Moreover, a near optimal resource allocation plan can be obtained with linear algorithmic complexity as the problem scale increases greatly.     

A quadratic programming approach to image labelling

Image labelling tasks are usually formulated within the framework of discrete Markov random fields where the optimal labels are recovered by extremising a discrete energy function. The authors present an alternative continuous relaxation approach to image labelling, which makes use of a quadratic cost function over the class labels. The cost function to be minimised is convex and its discrete version is equivalent up to a constant additive factor to the target function used in discrete MRF approaches. Moreover, its corresponding Hessian matrix is given by the graph Laplacian of the adjacency matrix. Therefore the optimisation of the cost function is governed by the pairwise interactions between pixels in the local neighbourhood. This leads to a sparse Hessian matrix for which the global minimum of the continuous relaxation problem can be efficiently found by solving a system of linear equations using the Cholesky factorisation. The authors elaborate on the links between the method and other techniques elsewhere in the literature and provide results on synthetic and real-world imagery. The authors also provide a comparison with competing approaches.     

Joint optimisation of capacity and safety stock allocation

We study the joint optimisation of capacity and safety stock allocation in assembly systems. Particularly, we consider capacitated systems with base-stock policies and periodic review. Capacity allocation is restricted by budget constraints, which can connect multiple systems. Our objective is to minimise overall inventory holding costs while satisfying service level as well as budget constraints. We propose an algorithm to jointly approximate optimal capacity allocation and base-stock levels. To this end, we introduce a set of convex approximations for this non-convex optimisation problem. In order to solve the resulting convex programmes, we analytically compute sample path derivatives via infinitesimal perturbation analysis. By iteratively adapting the approximations, we achieve good capacity allocations and base-stock levels for the original problem. Furthermore, we introduce a heuristic to allocate capacity, which originates from link capacity allocation in communication networks and use it as a benchmark. The algorithm is applied to small illustrative examples as well as cases motivated by the semiconductor manufacturing process at IBM Systems. It turns out that particularly for high utilisation levels, our algorithm can achieve significant improvements compared to the capacity allocation heuristic.     

Optimisation of burn-in time considering the hidden loss of quality deviations in the manufacturing process

The burn-in test time is an important parameter of the complex batch processing machine scheduling problem. The omission of the loss of quality deviations in manufacturing generates a non-comprehensive and imperfect result in the optimisation of burn-in time, which hinders the identification of proactive and economical optimisation strategies to prevent infant failure in manufacturing. To solve this problem, this study visualises and quantifies for the first time the hidden loss caused by quality deviations in manufacturing and uses it as a newly added constraint to optimise the burn-in time. Firstly, a quality loss model composed of visible yield loss and warranty costs related to measurable but undetectable reliability vulnerabilities is defined. Secondly, the loss effects of growing defects are measured during the burn-in test, and the optimal burn-in time expressed by the proposed quality loss model is traded off between the additional burn-in cost and the decreased quality loss for an acceptable low infant failure rate. Finally, the effectiveness of the proposed optimisation approach is demonstrated using actual data from a control board with a high infant failure rate. Results show that the proposed method can systematically combine the fundamental loss of quality deviations in the optimisation of burn-in time, which supplements the commonly used optimality criteria, with the upstream loss of quality deviations in the form of manufacturing defects.     

考虑余-废料资源回收的车间物料配送路径规划研究

针对离散制造生产过程中物料配送及余-废料资源回收效率低、成本高等问题,在分析车间物料流循环过程基础上结合物料配送时间窗限制,提出了物料配送和余-废料资源回收协同优化的物料再循环策略,并建立了以车间物料流总成本为目标的物料再循环路径规划模型。利用遗传算法在Matlab软件中对实例进行求解,验证了物料再循环策略应用于离散制造车间物料配送和余-废料资源回收的可行性和有效性。     

Optimal decision of an economic production quantity model for imperfect manufacturing under hybrid maintenance policy with shortages and partial backlogging

Considering the characteristics of the stochastic shift of the machine state and the uncertainty of the product quality of production, in this paper, we develop an optimisation decision of economic production quantity model for an imperfect manufacturing system under hybrid maintenance policy with shortages and partial backlogging. We assume that the production process is imperfect stemming from the machine reliability and the probability of out-of-control, a hybrid maintenance policy combined of emergency maintenance and preventive maintenance is executed during each production run. Three decision models based on the scenarios of machine breakdown and repair time are developed. The optimal production quantity and maintenance inspection number during each production run are solved with minimising the expected average cost of the system. Numerical examples are used to demonstrate the effectiveness and feasibility of the model. Sensitivity analysis is conducted to analyse the impacts of key parameters on the optimal decision. Some implications related to the effective and economical execution of maintenance policy for practitioners are derived.     

Cellular machine layout based on the Segmented Flow Topology

This paper introduces a facility layout design procedure for converting an existing manufacturing system with a predefined aisle structure to a cellular manufacturing system based on the 'segmented flow topology' (SFT) developed by Sinriech and Tanchoco. The proposed procedure is aimed at finding the best machine grouping, along with the locations of pick-up and delivery stations and machine layout for each cell based on an existing facility. The objective is to minimize the total material handling cost. In contrast to previous work in this area, the proposed design procedure takes into account both distance and material flow in forming machine clusters. In addition, a revised cost model for material handling system, which accounts for different aspects of capital and operating cost, is presented.     

Optimal integrated maintenance/production policy for randomly failing systems with variable failure rate

This article deals with the combined production and maintenance plans for a manufacturing system satisfying a random demand. We first establish an optimal production plan which minimises the average total inventory and production cost. Second, using this optimal production plan, and taking into account the deterioration of the machine according to its production rate, we derive an optimal maintenance schedule which minimises the maintenance cost. A numerical example illustrates the proposed approach, this analytical approach, based on a stochastic optimisation model and using the operational age concept, reveals the significant influence of the production rate on the deterioration of the manufacturing system and consequently on the integrated production/maintenance policy.     

Synchronization,cross-docking,and decoupling in supply chain networks

At any distribution centre (DC), the decision of whether to synchronise inbound and outbound flows for cross-docking, or to decouple these flows by maintaining inventory, has a significant impact on supply chain performance. Key drivers of this decision, in turn, are the sizes of the discrete lots that comprise the flows. Thus, we formulate an original optimisation model that determines order lot-sizing decisions to minimise, for given constant arc flows, the sum of ordering cost and pipeline inventory cost on arcs and buffer inventory at DCs. The model employs an average throughput as a surrogate to estimate buffer inventory at facilities at which synchronisation is not economical and therefore serves to decouple inbound and outbound flows. Perfect lot-for-lot matching of shipments would impose very restrictive constraints on supply chain operations, but equality of average throughput indicates an innovative, relaxed mode of synchronisation. This mode is practicable for cross-docking by means of bulk-breaking or consolidation of shipments. A heuristic approach based on the Lagrangian relaxation and subgradient optimisation is developed for the non-linear mixed-general integer optimisation model, which is illustrated by numerical examples and tested using a benchmark data set.     

An evolutionary approach for product line adaptation

A product line is rarely designed from scratch but usually evolves with products phased in and phased out. The adaptations of a product line and the associated changes in product mix and prices have complicated implications upon both market demand and manufacturing cost. This paper proposes an evolutionary approach to support coordinated decision-making among marketing, engineering and manufacturing regarding product line adaptation. A mixed logit discrete choice model and an activity based costing model are developed to quantify the demand and cost implications of product line adaptation, respectively. Product line adaptation is then formulated as a mixed integer non-linear programming problem. Given the coexistence of both discrete and continuous variables, a bi-level optimisation procedure combining genetic algorithm and differential evolution is developed for problem-solving. The proposed methodology is illustrated with an example of netbook product line design.     

Optimal threshold control for failure-prone tandem production systems

We consider the flow dynamics of a tandem production system formed by two failure-prone machines separated by a buffer stock. The production rates of the machines are regulated by a feedback mechanism which solves an associated optimal control problem with an average cost criterion. The cost structure penalizes both the entrance into and the sojourn on the buffer boundaries. The generic structure of the optimal control involves four buffer content thresholds. When the buffer content crosses these thresholds, the production rates are tuned to reduce the tendency to enter into the buffer boundaries. Using the fluid modelling framework, we obtain analytical results for the stationary buffer level distribution in the case where an operating machine can produce with, either a “nominal” or a “reduced” rate. In the stationary regime, the optimal positions of the buffer thresholds, the throughput and the average buffer content are presented.     

Manufacturing lot-sizing,procurement and delivery schedules over a finite planning horizon

In this study, an integrated manufacturing system for technology-related companies whose products are experiencing continuous price decrease during the life cycle is studied for optimal procurement, production and delivery schedules over a finite planning horizon. The model considers the inventory cost both at manufacturing and at delivery from supplier. Since the price is continuously decreasing, a manufacturing firm delivers the finished goods in small quantities frequently. Frequent deliveries in small lots are effective to reduce the total cost of the supply chain. The key for high-tech industries is to reduce the inventory holding time since the component prices are continuously decreasing, and this can only be achieved by implementing an efficient supply chain. Therefore, the main purpose of this paper is to develop an integrated inventory model for high-tech industries in JIT environment under continuous price decrease over finite planning horizon while effectively and successfully accomplishing supply chain integration so that the total cost of the system is minimal. An efficient algorithm is developed to determine the optimal or near-optimal lot sizes for raw material procurement, and manufacturing batch under a finite planning horizon. Finally, the solution technique developed for the model is illustrated with numerical examples.     

Joint optimization of maintenance,buffers and machines in manufacturing lines

This article considers a series manufacturing line composed of several machines separated by intermediate buffers of finite capacity. The goal is to find the optimal number of preventive maintenance actions performed on each machine, the optimal selection of machines and the optimal buffer allocation plan that minimize the total system cost, while providing the desired system throughput level. The mean times between failures of all machines are assumed to increase when applying periodic preventive maintenance. To estimate the production line throughput, a decomposition method is used. The decision variables in the formulated optimal design problem are buffer levels, types of machines and times between preventive maintenance actions. Three heuristic approaches are developed to solve the formulated combinatorial optimization problem. The first heuristic consists of a genetic algorithm, the second is based on the nonlinear threshold accepting metaheuristic and the third is an ant colony system. The proposed heuristics are compared and their efficiency is shown through several numerical examples. It is found that the nonlinear threshold accepting algorithm outperforms the genetic algorithm and ant colony system, while the genetic algorithm provides better results than the ant colony system for longer manufacturing lines.     

An integrated optimal inventory lot-sizing and vehicle-routing model for a multisupplier single-assembler system with JIT delivery

In a manufacturing system, a just-in-time (JIT) procurement and supply system is important for reducing cost and responding to customer’s requirement quickly. Successful implementation of a JIT system needs supplier/manufacturer cooperation in small lot-size delivery and inbound logistics cost reduction. In this study, an integrated optimal model of inventory lot-sizing vehicle routing of multisupplier single-manufacturer with milk-run JIT delivery is established. A novel method for computing transportation cost is proposed. Because the integrated model is a NP-hard problem, a meta-heuristic algorithm of ant colony optimisation is developed for solving the model. Numerical examples are used to demonstrate and test the effectiveness of the model and the algorithm. The results show that integrated model with milk-run delivery can reduce the total cost and realise the JIT production and procurement philosophy which emphasises small lot-size production and delivery. The results highlight the importance of cooperation between suppliers and manufacturers in JIT production practices.     

Modelling and design of adaptive structures using B-spline strip models

The aim of this paper is to present a family of laminated plate/shell B-spline finite strip models based on higher order displacement fields applied to the optimal design of laminated composite plate/shell structures with embedded and/or surface bonded piezoelectric actuators and sensors. Simulated annealing, as a stochastic global optimisation technique, is used to improve the performance of composite adaptive structures subjected to behavioural functions and/or constraints, with continuous and discrete design variables. To show the applicability of the proposed optimisation models, two illustrative examples are presented and discussed.     

Flexible work-in-process production system in supply chain management under quality improvement

For a complex product production, any flexible manufacturing system with a work-in-process inventory is recommended for a supply chain management (SCM) system. Building a flexible manufacturing system increases the total cost of the supply chain; for this reason, a discrete investment is important. For flexible production systems, production rate within a finite specific interval of production rate as work-in-process inventory is calculated. The aim of the supply chain is to reduce the total cost when demand during the lead time is a random variable with a normal distribution. A crashing cost is utilised to reduce the duration of lead time within the supply chain system. A model is proposed to obtain the optimal flexible production rate with the reduced total cost of the supply chain. A classical optimisation technique is employed to obtain the closed-form and quasi-closed-form solutions of the decision variables. An improved algorithm is designed to obtain the global minimum cost of SCM under the framework of a flexible production system. An illustrative numerical example and sensitivity analysis are given to test the model. A numerical study proves that this model obtains the minimum cost with the optimal decision variables.     

Travel-time models considering the operating characteristics of the storage and retrieval machine

Existing travel-time models of automated storage/retrieval systems (AS/RS) assume the average uniform velocity, ignoring the operating characteristics of storage/retrieval (S/R) machine such as the acceleration/deceleration rate and the maximum velocity. Consequently, the optimal design and schedule based on the existing models is far from optimal from the practical point of view. This paper presents continuous analytical models of travel time which integrate the operating characteristics of S/R machine. Using a randomized assignment policy, travel times are determined for both single and dual command cycles. The models developed are examined through discrete evaluation procedures.     

运输能力柔性约束的供应链Pareto优化策略

针对单位产品运输成本对批量敏感并由生产商负责产品运输的情况,建立了供需双方在分散决策和集中决策情形下的最佳批量模型.分析结果表明运输能力柔性越强,生产商的最佳生产批量越小,与批发商要求的短周期、小批量订货越接近,从而在不增加成本的情况下,生产商能够对批发商的需求快速响应.且当运输能力非完全柔性时,生产商可以通过降低产品转让价格改让批发商负责产品运输,以使批发商在分散决策情形下的最佳订货批量更接近于生产商的最佳生产批量和供应链在集中决策情形下的订货批量,从而在供需方双赢的前提下实现整个供应链的利益优化.     

Order-oriented cooperative sequencing optimisation in multi-mix-model assembly lines

Order-oriented products assembly sequence among different assembly lines becomes a critical problem for mass customisation manufacturing systems. It significantly affects system productivity, delivery time, and manufacturing cost. In this paper, we propose a new approach to extend the traditional products sequencing from mixed model assembly line (MMAL) to multi-mixed model assembly lines (MMMALs) to obtain the optimal assembly sequence with the objectives of minimising consumption waviness of each material in the lines, assembly line setup cost, and lead-time. A multi-objective optimisation algorithm based on variable neighbourhood search methods (VNS) is developed. We perform an industrial case study in order to demonstrate the practicality and effectiveness of the proposed approach.