MOAPPS 1.0: Aggregate production planning using the multiple-objective tabu search

In recent years, there has been a trend in the research community to solve large-scale complex planning and design problems using the modern heuristics optimization techniques (i.e. tabu search, genetic algorithms, etc.). This is mainly due to unsuitability of the classical solution techniques in many circumstances. Depending upon the assumptions made and the modelling approach used, aggregate production planning (APP) problems can be quite complex and large scale. Therefore, there is a need to investigate the suitability of modern heuristics for their solution. In this paper, the multiple-objective APP problem is formulated as a pre-emptive goal-programming model and solved by a specially developed multiple-objective tabu search algorithm. The mathematical formulation is built upon Masud and Hwang's model (original model) due to its extensibility characteristics. The present model extents their model by including subcontracting and setup decisions. The multiple-objective tabu search algorithm is applied to both the original and extended model. Results obtained from the solution of the original model are then compared. It is observed that the multiple-objective tabu search algorithm can be used as an alternative solution mechanism for solving APP problems. During this study, an object-oriented program is also developed using C++. This software is named as MOAPPS 1.0 (Multiple Objective Aggregate Production Planning Software).     

Aggregate production planning for shipbuilding with variation-inventory trade-offs

Shipbuilding is a complex production system characterised by a complicated work and organisation structure, prolonged production lead time, and heterogeneous resource requirements. Thus, effectively planning all involved activities presents a challenging task and requires the timely coordination between the successive production stages at the plant level and effective resource allocation at the workshop level. With the work breakdown structure of all projects and their corresponding building strategies, the aggregate production planning (APP) is to address two important issues, namely, workforce level and inventory usage so that the fluctuating demands from downstream processes can be satisfied in a cost-effective manner. To achieve this, a novel APP model is proposed for ship production to minimise the variation of aggregate man-hour over the planning horizon and simultaneously minimise the logistic demands of the interim products. In view of the combinatorial nature and computational complexity, a directed genetic algorithm based solver has been developed to solve the two-conflicting-objective optimisation problem. The proposed approach has been applied to a case study and preliminary results have shown certain effectiveness in handling various situations with different planning strategies.     

Integrated aggregate supply chain planning using memetic algorithm – A performance analysis case study

This paper aims to examine how a complex supply chain yields cost reduction benefits through the global integration of production and distribution decisions. The research is motivated by a complex real world supply chain planning problem facing a large automotive company. A mixed-integer nonlinear production-distribution planning model is solved using a customised memetic algorithm. The performance and effectiveness of the developed model and solution approach in achieving the global optimisation is investigated through experiments comparing the numerical results from the proposed integrated approach with those of a typical non-integrated (hierarchical) production–distribution optimisation.     

A hybrid particle swarm based method for process planning optimisation

A process planning (PP) problem is defined as to determine a set of operation-methods (machine, tool, and set-up configuration) that can convert the given stock to the designed part. Essentially, the PP problem involves the simultaneous decision making of two tasks: operation-method selection and sequencing. This is a combinatorial optimisation problem and it is difficult to find the best solution in a reasonable amount of time. In this article, an optimisation approach based on particle swarm optimisation (PSO) is proposed to solve the PP problem. Due to the characteristic of discrete process planning solution space and the continuous nature of the original PSO, a novel solution representation scheme is introduced for the application of PSO in solving the PP problem. Moreover, two kinds of local search algorithms are incorporated and interweaved with PSO evolution to improve the best solution in each generation. The numerical experiments and analysis have demonstrated that the proposed algorithm is capable of gaining a good quality solution in an efficient way.     

Tactical production planning in a hybrid Make-to-Stock–Make-to-Order environment under supply,process and demand uncertainties: a robust optimisation model

In this paper, we consider a hybrid ‘Make-to-Stock–Make-to-Order’ environment to develop a novel optimisation model for medium-term production planning of a typical multi-product firm based on the competencies of the robust optimisation methodology. Three types of uncertainties: suppliers, processes and customers, are incorporated into the model to construct a robust practical model in an uncertain business environment. The modelling procedure is started with applying deterministic linear programming to develop a new multi-objective approach for the combination of multi-product multi-period production planning and aggregate production planning problems. Then, the proposed deterministic model is transformed into a robust optimisation framework and the solution procedure is designed according to the Lp-Metric methodology. Next, using the IBM ILOG CPLEX optimisation software, the proposed model is evaluated by applying the data collected from an industrial case study. Final results illustrate the applicability of the proposed model.     

A robust optimisation model for aggregate and detailed planning of a multi-site procurement-production-distribution system

The planning problem in the context of a multi-site procurement-production-distribution system (MSPPDS) considered in this paper is motivated from a real life case of a multinational consumer goods company. A robust optimisation model considering model robustness and solution robustness in the objective function is developed for integrated planning in three dimensions. Detailed production, procurement and distribution plans are integrated; countrywide aggregate production plan is integrated with a detailed plan. Similarly the detailed production plans from the previous planning cycle are integrated with current production plans. Constraints on storage space, production capacity and the time lag between procurement, production and distribution activities are captured in the model. Procurement and production plans are treated as ‘here-and-now’ decisions and the distribution plans are treated as ‘wait-and-see’ decisions to be implemented based on the realised demand scenario. The model is illustrated using an example problem and also successfully applied to the data of a consumer goods company involving 104,000 variables (with 832 integer variables) and 21,000 constraints.     

A swept volume approach based on hermite interpolation for optimization in collision‐free motion planning

Abstract

The recursive quadratic programming (RQP) technique has been successfully applied for the motion planning problem. This paper inherits the RQP optimization formulation to solve collision‐free motion planning problems. The focus of the paper is to develop a more accurate approach to represent the swept volume based on Hermite interpolation. The non‐convex swept volume may be described by parametric representation. Based on this idea, the non‐convex limitation of the motion planning by the previous RQP technique can be overcome and it has yielded accurate answers in distance calculation. Also, have been presented to illustrate and demonstrate this approach in the paper.     

Optimising resource portfolio planning for capital-intensive industries under process-technology progress

This paper addresses the problem of resource portfolio planning of firms in high-tech, capital-intensive manufacturing industries. In light of the strategic importance of resource portfolio planning in these industries, we offer an alternative approach to modelling capacity planning and allocation problems that improves the deficiencies of prior models in dealing with three salient features of these industries, i.e. fast technological obsolescence, volatile market demand, and high capital expenditure. This paper first discusses the characteristics of resource portfolio planning problems including capacity adjustment and allocation. Next, we propose a new mathematical programming formulation that simultaneously optimises capacity planning and task assignment. For solution efficiency, a constraint-satisfied genetic algorithm (CSGA) is developed to solve the proposed mathematical programming problem on a real-time basis. The proposed modelling scheme is employed in the context of a semiconductor testing facility. Experimental results show that our approach can solve the resource portfolio planning problem more efficiently than a conventional optimisation solver. The overall contribution is an analytical tool that can be employed by decision makers responding to the dynamic technological progress and new product introduction at the strategic resource planning level.     

GA-based adaptive setup planning toward process planning and scheduling integration

Setup planning of a part for more than one available machine is a typical combinatorial optimisation problem under certain constraints. It has significant impact not only on the whole process planning but also on scheduling, as well as on the integration of process planning and scheduling. Targeting the potential adaptability of process plans associated with setups, a cross-machine setup planning approach using genetic algorithms (GA) for machines with different configurations is presented in this paper. First, based on tool accessibility analysis of different machine configurations, partially sequenced machining features can be grouped into certain setups; then by responding to the requirements from a scheduling system, optimal or near-optimal setup plans are selected for certain criteria, such as cost, makespan and/or machine utilisation. GA is adopted for the combinatorial optimisation, which includes gene pool generation based on tool accessibility examination, setup plan encoding and fitness evaluation, and optimal setup plan selection through GA operations. The proposed approach is implemented in a GA toolbox, and tested using a sample part. The results demonstrate that the proposed approach is applicable to machines with varying configurations, and adaptive to different setup requirements from a scheduling system due to machine availability changes. It is expected that this approach can contribute to process planning and scheduling integration when a process plan is combined with setups for alternative machines during adaptive setup planning.     

Reducing tardy jobs by integrating process planning and scheduling functions

This paper presents a dynamic approach to reduce tardy jobs through the integration of process planning and scheduling in a batch-manufacturing environment. The developed method aims at re-generating a schedule with fewer tardy jobs, step by step, by exploring the process plan solution space of the tardy jobs. The integrated system comprises a process planning module, a scheduling module, and an integrator module. The process planning module employs an optimisation approach in which the entire plan solution space is first generated and a search algorithm is then used to find the optimal plan, while the scheduling module is based on commonly used heuristics. Based on the job tardiness information of the generated schedule, the integrator module automatically issues a modification order to the process plan solution space of the tardy jobs. The process planning and scheduling modules are then re-run to generate a new plan/schedule solution. Through this iterative process, a satisfactory schedule can be gradually achieved. The uniqueness of this approach is characterised by the flexibility of the process planning strategy, which makes full use of the plan solution space intuitively to achieve a satisfactory schedule. Several examples are presented to confirm the efficacy and the effectiveness of the developed integration system.     

An integral planning model that includes production,selling price,cash flow management and flexible capacity

Many authors consider that production and marketing decisions should be integrated. In this paper, we discuss an aggregate planning problem that includes production, selling price, cash management and flexible capacity (by means of hiring and firing and with the possibility of unlimited production subcontracting). The demand is considered to be a nonlinear function of the product selling price. The problem, which is modelled as a mixed integer linear program, can be solved using standard optimisation software. The results of a computational experiment and a numerical example are shown to illustrate the performance of the proposed model and obtain some managerial insights.     

Mathematical modelling of a robust inspection process plan: Taguchi and Monte Carlo methods

This study develops a new optimisation framework for process inspection planning of a manufacturing system with multiple quality characteristics, in which the proposed framework is based on a mixed-integer mathematical programming (MILP) model. Due to the stochastic nature of production processes and since their production processes are sensitive to manufacturing variations; a proportion of products do not conform the design specifications. A common source of these variations is maladjustment of each operation that leads to a higher number of scraps. Therefore, uncertainty in maladjustment is taken into account in this study. A twofold decision is made on the subject that which quality characteristic needs what kind of inspection, and the time this inspection should be performed. To cope with the introduced uncertainty, two robust optimisation methods are developed based on Taguchi and Monte Carlo methods. Furthermore, a genetic algorithm is applied to the problem to obtain near-optimal solutions. To validate the proposed model and solution approach, several numerical experiments are done on a real industrial case. Finally, the conclusion is provided.     

Concurrent product configuration and process planning,towards an approach combining interactivity and optimality

In mass customisation, defining concurrently the configured product and the planning of the associated production process is a key issue in the customer/supplier relationship. Nevertheless, few studies propose supporting the decision-maker during the resolution of this significant problem. After studying the decision-maker's needs and problem characterisation (modelling and scale aspects), we propose in this paper a two-step approach with the aid of some tools. The first step allows the customer or internal requirements to be captured interactively with a constraint-based approach. However, this step does not lead to one single solution, e.g. there are many uninstantiated remaining decision variables. In this paper, we suggest adding an original optimisation step to complete this task. Thus, the contribution of the study is twofold: first, methodologically to define a new two-step approach that meets industrial needs; and second, to provide adapted tools especially for the optimisation step. The optimisation step, using a multi-criteria constrained evolutionary algorithm, allows the user to select their own cost/cycle time compromise among a set of Pareto optimised solutions. A conventional evolutionary algorithm is adapted and modified, with the inclusion of filtering processing, in order to avoid generating invalid solutions. Experimentations are described, and a comparison is made with a branch-and-bound approach that outlines the interest in the propositions.     

A dynamic programming approach to integrated assembly planning and supplier assignment with lead time constraints

As manufacturers face fierce competition in the global market, responsiveness has become an important competitiveness factor in addition to quality and cost. One essential responsiveness strategy is to reduce product development and lead times by integrating assembly planning with supplier assignment. This paper addresses the problem of integrated assembly and supply chain design under lead-time constraints by formulating and solving an optimisation problem with minimal total supply chain costs. This new time-constrained joint optimisation problem belongs to an NP-hard resource-constrained scheduling problem. To model this problem effectively, we develop a novel Hyper AND/OR graph and apply it for integrating assembly and supply chain decisions. We also develop a dynamic programming model and associated algorithm in order to solve the integrated optimisation problem with pseudo-polynomial time complexity in practice. Numerical case studies validate that the methods developed can solve the integrated decision-making problem optimally and efficiently. This paper overcomes the limitations of previous studies on concurrent assembly decomposition and supplier selection, which optimises cost without time constraints. The models and results of this research can be applied to a variety of areas including assembly design, maintenance module planning and supply chain restructuring.     

An exact penalty function method for optimising QAP formulation in facility layout problem

A quadratic assignment problem (QAP), which is a combinatorial optimisation problem, is developed to model the problem of locating facilities with material flows between them. The aim of solving the QAP formulation for a facility layout problem (FLP) is to increase a system’s operating efficiency by reducing material handling costs, which can be measured by interdepartmental distances and flows. The QAP-formulated FLP can be viewed as a discrete optimisation problem, where the quadratic objective function is optimised with respect to discrete decision variables subject to linear equality constraints. The conventional approach for solving this discrete optimisation problem is to use the linearisation of the quadratic objective function whereby additional discrete variables and constraints are introduced. The adoption of the linearisation process can result in a significantly increased number of variables and constraints; solving the resulting problem can therefore be challenging. In this paper, a new approach is introduced to solve this discrete optimisation problem. First, the discrete optimisation problem is transformed into an equivalent nonlinear optimisation problem involving only continuous decision variables by introducing quadratic inequality constraints. The number of variables, however, remains the same as the original problem. Then, an exact penalty function method is applied to convert this transformed continuous optimisation problem into an unconstrained continuous optimisation problem. An improved backtracking search algorithm is then developed to solve the unconstrained optimisation problem. Numerical computation results demonstrate the effectiveness of the proposed new approach.     

Reconfiguration of assembly lines under the influence of high product variety in the automotive industry–a decision support system

In this paper we consider the mixed model assembly line reconfiguration problem in the context of auto production which is characterised by a make-to-order production process and a huge product variety. Starting from a given line balancing solution the goal is to minimise production costs in the short term for a largely known production program by reassigning and shifting tasks between workstations. We present a mathematical optimisation model that aims at minimising the costs incurred by overload situations, regular workers and reconfiguration measures. Due to the model's complexity, lack of data and acceptance issues it is hardly possible to fully automate the solution process in an industrial environment. Therefore, we present a decision support approach that consists of visualisation components, new numerical indicators and an integrated heuristic optimisation procedure to semi-automate the reconfiguration process. In particular, reconfiguration costs can be taken into account and no complete precedence graph is required. Finally, we show on the basis of two industrial case studies that our approach can be successfully applied in a practical environment where it was capable of drastically reducing the occurrence of overload situations.     

Operator allocation planning for reconfigurable production line in one-of-a-kind production

In a one-of-a-kind production (OKP) company, the operation routing and processing time of an order are usually different from the others due to high customisation. As a result, an OKP company needs to dynamically adjust the production resources to keep the production lines reconfigurable. Through a proper assignment of operators in different sections of a production line, bottlenecks and operator re-allocation during production can be reduced effectively. In this paper, a mathematical model is introduced for optimal operator allocation planning on a reconfigurable production line in OKP. The optimisation objectives are to minimise the total number of the operators, total job earliness and tardiness, and the average work-in-process storage. A branch-and-bound algorithm with efficient pruning strategies is developed to solve this problem. The proposed model and the algorithm are empirically validated by using the data of a windows and doors manufacturing company. A software system based on the proposed approach has been implemented in the company.     

Capacity and material requirement planning modelling by comparing deterministic and fuzzy models

A model for the capacity and material requirement planning problem with uncertainty in a multi-product, multi-level and multi-period manufacturing environment is proposed. An optimization model is formulated which takes into account the uncertainty that exists in both the market demand and capacity data, and the uncertain costs for backlog. This work uses the concept of possibilistic programming by comparing trapezoidal fuzzy numbers. Such an approach makes it possible to model the ambiguity in market demand, capacity data, cost information, etc. that could be present in production planning systems. The main goal is to determine the master production schedule, stock levels, backlog, and capacity usage levels over a given planning horizon in such a way as to hedge against the uncertainty. Finally, the fuzzy model and the deterministic model adopted as the basis of this work are compared using real data from an automobile seat manufacturer. The paper concludes that fuzzy numbers could improve the solution of production planning problems.     

Robotic disassembly sequence planning using enhanced discrete bees algorithm in remanufacturing

Increasing attention is being paid to remanufacturing due to environmental protection and resource saving. Disassembly, as an essential step of remanufacturing, is always manually finished which is time-consuming while robotic disassembly can improve disassembly efficiency. Before the execution of disassembly, generating optimal disassembly sequence plays a vital role in improving disassembly efficiency. In this paper, to minimise the total disassembly time, an enhanced discrete Bees algorithm (EDBA) is proposed to solve robotic disassembly sequence planning (RDSP) problem. Firstly, the modified feasible solution generation (MFSG) method is used to build the disassembly model. After that, the evaluation criterions for RDSP are proposed to describe the total disassembly time of a disassembly sequence. Then, with the help of mutation operator, EDBA is proposed to determine the optimal disassembly sequence of RDSP. Finally, case studies based on two gear pumps are used to verify the effectiveness of the proposed method. The performance of EDBA is analysed under different parameters and compared with existing optimisation algorithms used in disassembly sequence planning (DSP). The result shows the proposed method is more suitable for robotic disassembly than the traditional method and EDBA generates better quality of solutions compared with the other optimisation algorithms.     

Scenario-based multi-objective robust scheduling for a semiconductor production line

Scheduling problems of semiconductor manufacturing systems (SMS) with the goal of optimising some classical performance indices (NP-hard), tend to be increasingly complicated due to stochastic uncertainties. This paper targets the robust scheduling problem of an SMS with uncertain processing times. A three-stage multi-objective robust optimisation (MORO) approach is proposed, that can collaboratively optimise the performance indices and their robustness measures. In the first stage, this paper studies the scheduling problem in the deterministic environment and obtains feasible scheduling strategies that perform well in four performance indices (the average cycle time (CT), the on-time delivery rate (ODR), the throughput (TP), and the total movement amount of wafers (MOV)). Then, in the second stage, the uncertainties are introduced into the production system. In the third stage, this paper proposes a hybrid method consisting of scenario planning, discrete simulation, and multi-objective optimisation to obtain an approximately and more robust optimal solution from the feasible scheduling strategy set. The proposed MORO approach is tested in a semiconductor experiment production line and makes a full analysis to illustrate the effectiveness of our method. The results show that our MORO is superior concerning the total robustness with multi-objective.