An agent-based negotiation approach to integrate process planning and scheduling

This paper presents the development of an agent-based negotiation approach to integrate process planning and scheduling (IPPS) in a job shop kind of flexible manufacturing environment. The agent-based system comprises two types of agents, part agents and machine agents, to represent parts and machines respectively. For each part, all feasible manufacturing processes and routings are recorded as alternative process plans. Similarly, alternative machines for an operation are also considered. With regard to the scheduling requirements and the alternative process plans of a part, the proposed agent-based IPPS system aims to specify the process routing and to assign the manufacturing resources effectively. To establish task allocations, the part and machine agents have to engage in bidding. Bids are evaluated in accordance with a currency function which considers an agent's multi-objectives and IPPS parameters. A negotiation protocol is developed for negotiations between the part agents and the machine agents. The protocol is modified from the contract net protocol to cater for the multiple-task and many-to-many negotiations in this paper. An agent-based framework is established to simulate the proposed IPPS approach. Experiments are conducted to evaluate the performance of the proposed system. The performance measures, including makespan and flowtime, are compared with those of a search technique based on a co-evolutionary algorithm.     

Risk-based analysis of manufacturing systems

A manufacturing system considered here consists of a machine that processes parts and an automatic conveyor that transports immediately a finished part to an assembly cell (i.e. a single workstation facility is examined). The system can hold a maximum number of processed parts on the conveyor, which determines its size. Modelling the system as a family of Birth–Death Processes with finite size in equilibrium, indexed by the system utilisation parameter, and depending on the concepts of system information and system entropy (i.e. mean information), we promote a risk-based analysis of manufacturing systems. The current number of processed parts on the conveyor determines the system particular states. The performance measures of a system are: risk (i.e. uncertainty) of the system (represented by system entropy), throughput of the system, utilisation of the machine, utilisation of the conveyor, and information range of the system. They are simultaneously investigated with respect to the system utilisation parameter, in order for an optimal trade-off among them to be established. This analysis is illustrated on the information linear, Erlang, Binomial and Pascal held manufacturing systems. Regarding the managerial insights, a use case of a system target output is considered, comparing the above system types. This approach can also be used for analysis of an assembly line consisting of multiple machines that have different operation times and buffers between them.     

A priority scheduling approach for flexible job shops with multiple process plans

This paper considers the job shop scheduling problem with alternative operations and machines, called the flexible job shop scheduling problem. As an extension of previous studies, operation and routing flexibilities are considered at the same time in the form of multiple process plans, i.e. each job can be processed through alternative operations, each of which can be processed on alternative machines. The main decisions are: (a) selecting operation/machine pair; and (b) sequencing the jobs assigned to each machine. Since the problem is highly complicated, we suggest a practical priority scheduling approach in which the two decisions are done at the same time using a combination of operation/machine selection and job sequencing rules. The performance measures used are minimising makespan, total flow time, mean tardiness, the number of tardy jobs, and the maximum tardiness. To compare the performances of various rule combinations, simulation experiments were done on the data for hybrid systems with an advanced reconfigurable manufacturing system and a conventional legacy system, and the results are reported.     

Capacity estimation of a multi-product unreliable production line

This paper addresses the problem of capacity estimation of a multi-product production line composed of m unreliable workstations and ( m - 1) intermediate buffers. A simulation-based experimental design methodology is proposed to improve the performance of this flexible production line, which is expressed as the cycle time. The modelling approach integrates, in a more representative manner, the many parameters that impact the capacity of the manufacturing system. These are: workstation failure, repair, and set-up as product type changes. An experimental optimization to judiciously locate/allocate buffers between workstations is used to determine the maximum contribution of buffers on the overall performance of this serial manufacturing system. A case study is presented to show the modelling steps and to assess the contribution of each buffer. Analysis of the results shows the trade-offs between the different levels of buffers and the cycle time of the production line. The results present the percentage of workstations' operation, set-up, downtime, blocking and starving. In addition, for each combination of buffer sizes, the bottleneck workstation is identified. Changing a buffer size impacts directly the cycle time and, in some cases, a new bottleneck workstation evolves. The results provide insights into the performance of the system, including detection of important interactions and critical parameters. Considering various design scenarios, our methodology helps to identify the best strategy of buffer location/allocation that ensures a minimum cycle time, while considering other criteria. This could be achieved with less experimental effort and the manager could make the selection of the best design scenario. An analysis of the dynamic behaviour of buffers and their effectiveness is also given and commented upon.     

A new method for workshop real time scheduling

Workshop real time scheduling is one of the key factors in improving manufacturing system efficiency. This is especially true for workshops in which various products are processed simultaneously, and use multipurpose machines. Real time scheduling is appropriate to handle perturbations in the environment of the manufacturing process, a major issue at the shop floor level. The products to be processed have release times and due dates and the resources are multipurpose machines. A decision support system for real time scheduling is described. It is based on an original approach, aiming at searching for characteristics of a set of schedules compatible with the main manufacturing constraints to be satisfied. This set of schedules is obtained by defining sequences of groups of permutable operations for every resource. A method to find such a set is described. We emphasize the use of this group sequence as a decision support system. Significant states and events requiring real time decisions are identified and three main types of decisions are analysed. For each of them, the proposed decision support system is detailed and explained.     

A review of “Advances in Computer-Integrated Manufacturing.” Edited by Peter J. Sacket (JAI Press Ltd., 1990) [pp. 188]. Price £ 48, US $ 81·95.

Global competition and rapidly changing customer requirements are forcing major changes in the production styles and configuration of manufacturing organizations. Traditional centralized manufacturing systems are not able to meet such requirements. This paper proposes an agent-based approach for dynamically creating and managing agent communities in such widely distributed and everchanging manufacturing environments. After reviewing the research literature, an adaptive multi-agent manufacturing system architecture called MetaMorph is presented and its main features are described. Such architecture facilitates multi-agent coordination by minimizing communication and processing overheads. Adaptation is facilitated through organizational structural change and two learning mechanisms: learning from past experiences and learning future agent interactions by simulating future dynamic, emergent behaviours. The MetaMorph architecture also addresses other specific requirements for next generation manufacturing systems, including scalability, reliability, stability, maintainability, flexibility, real-time planning and scheduling, standardized communication, fault tolerance, and security. The proposed architecture is implemented as a multi-agent virtual manufacturing system, in simulation form, which incorporates heterogeneous manufacturing agents within different agent-based shop floors or factories. The experimental results have shown the potential of the agent-based approach for advanced manufacturing systems.     

Development of a hybrid negotiation scheme for multi-agent manufacturing systems

A hybrid inter-agent negotiation mechanism based on currency and a pre-emption control scheme is proposed to improve the performance of multi-agent manufacturing systems. The multi-agent system considered consists mainly of four types of agents: machine, clone, part and mediator. The machine agent controls the scheduling and the execution of a task. The clone agent aims to maximize the utilization rate by attracting relevant work to the machine. The part agent communicates with the machine agent or clone agent to acquire necessary production resources in order to get the required processing done, and the mediator agent contains the status of the part that will be processed by the subcontracting machine agent. The primary objective is to design decentralized control protocols for discrete part manufacturing systems to enhance the efficiency of the system and to allocate dynamically the resources to critical jobs based on the dynamic search tree. This research incorporates both the currency and the pre-emption schemes within a common framework. Currency functions are used to help the agents meet their individual objectives, whereas the pre-emption scheme is used to expedite the processing of parts based on their due dates. A dynamic search algorithm for the best route selection of different operations based on the job completion time is also proposed and it is implemented on a small manufacturing unit.     

A mathematical programming model for reconfiguration of flexible manufacturing cells

In flexible manufacturing cells, changes in demand size, product mix, part variety, existing routings and set-up/operation times may require reconfiguration of the cells. In this study, an approach is developed to decide when and how such a reconfiguration should be carried out for existing cells. This study considers reconfiguration in terms of changing part routings, adding a new machine type in a cell, duplicating an existing machine type, removing an existing machine from a cell and transferring a machine to another cell. The study also shows the total number of tools of each type on each machine located in each cell after reconfiguration. To make the optimal reconfiguration decisions, a mathematical programming model to minimize the total reconfiguration cost is developed. The developed model considers the lower and upper bounds on machine utilizations and the time limits on machine cycle times to decide when to reconfigure the system.     

A multi-level modelling system for the design of flexible machining installations

Modern flexible manufacturing facilities can be highly complex, consisting of the latest developments in machine tool technology, automated material handling systems and sophisticated cell controllers. The design and management of such systems requires a large number of decisions and choices with regard to production mix, assignment of fixtures and cutting tools. A large number of commercial computer modelling packages are now available in the market place. Although these allow valuable assistance in the analysis of a manufacturing facility, they usually take significant amounts of time to build models and require a large amount of training, and can be constraining in their application. This paper establishes a research prototype for a multi-level approach for the realization of a three-phase design and modelling system for flexible machining facilities. It portrays the view of an integrated fully data-driven solution underpinned by a machining cell database, and outlines three major areas of work within the structure, i.e. the 'Cell Configurator', 'Evaluator' and 'Emulator'. The approach is demonstrated and supported throughout the paper by an industrial case study of a modern three-machine flexible machining cell, illustrating the use of the underlying methodology behind the approach and typical inputs/outputs at each phase. The final part of the paper provides a discussion of the approach adopted based on user comments and in relation to commercial simulation tools available.     

Investigation of the reconfigurable control system for an agile manufacturing cell

A new type of manufacturing cell, with characteristics of reconfigurability, reusability and scalability, needs to be developed. To achieve the agile reconfiguration of a manufacturing cell, the cell control system must be rapidly and efficiently generated or modified. In this paper, a multi-agent based architecture is defined that supports the design and implementation of highly reconfigurable control systems for agile manufacturing cells, which are comprised of resource agents (material processing agents, material handling agents, and material storage agents), a control agent, and an information agent, in order to reduce costs and increase the control system's agility with respect to the changing environment. Different agents in the cell control system can be organized dynamically, communicate with each other through messages, and cooperate with each other to perform flexibly the task in the cell control system. The structure of the agents is proposed and the message-passing between agents is discussed in detail.     

Intercell scheduling: A negotiation approach using multi-agent coalitions

Intercell scheduling problems arise as a result of intercell transfers in cellular manufacturing systems. Flexible intercell routes are considered in this article, and a coalition-based scheduling (CBS) approach using distributed multi-agent negotiation is developed. Taking advantage of the extended vision of the coalition agents, the global optimization is improved and the communication cost is reduced. The objective of the addressed problem is to minimize mean tardiness. Computational results show that, compared with the widely used combinatorial rules, CBS provides better performance not only in minimizing the objective, i.e. mean tardiness, but also in minimizing auxiliary measures such as maximum completion time, mean flow time and the ratio of tardy parts. Moreover, CBS is better than the existing intercell scheduling approach for the same problem with respect to the solution quality and computational costs.     

Dynamic relative positioning of AGVs in a loop layout to minimize mean system response time

One of the control decisions in the operation of an automated guided vehicle (AGV) system is to determine the home locations of idle vehicles. In this paper, the problems of selecting home location of a vehicle when idle in a single loop AGV network is presented. As the number of unit loads to be picked up at each workstation dynamically changes over time, the optimum home location of vehicles may also change. Based on the objective of minimizing the expected response time of a vehicle, models are constructed. Example problems are given to illustrate the use of the solution algorithms. The results of the system response times obtained using the dynamic dwell point models are compared with those of other dwell point rules.     

A methodology for modelling comprehensive international procurement costs

As the economy becomes more globalised and competitive, firms are manufacturing goods in a wider variety of locations. This may be to reduce costs by moving to a low cost country or to place production closer to potential customers. What is often lacking in these facility location decisions is a holistic assessment of the costs associated with production location decisions. Too often the assessment is focused only on a limited set of cost factors (e.g. direct manufacturing and shipping) and does not take into account the dynamic nature of some costs. To address these limitations a comprehensive cost model to assess the cost of procuring goods from alternative locations is presented. A methodology is detailed for monetising many costs associated with international procurement. An illustrative case study analysing the procurement of goods from two locations in Mexico and one in the US is detailed. Results of the case show that the non-direct manufacturing costs associated with procurement (e.g. inventory holding costs and shipping) can be greater than direct manufacturing costs. The effects of fuel and labour cost sensitivity on the alternative locations are also detailed.     

Solving the machine-loading problem in a flexible manufacturing system using a combinatorial auction-based approach

The next generation manufacturing system is conceived to be intelligent enough to take decisions and automatically adjust itself to situations such as variations in production demand and machine breakdowns. The manufacturing control system must have the intelligence to ensure real time operational control by interacting with different manufacturing subsystems. One of the prominent methodologies to deal with the problem of distributed manufacturing systems is the auction-based heuristic control strategy in which various entities bid themselves, accept bids and make selection amongst bids. The present paper addresses the flexible manufacturing system machine-loading problem where job selection and operation allocation on machines are to be performed such that there is a minimization of system unbalance and a maximization of throughput. The methodology of winner determination using the combinatorial auction process is employed to solve the flexible manufacturing system machine-loading problem. In the combinatorial auction, allowing bidding on a combination of assets offers a way to enhance the efficiency of allocating the assets. The performance of the proposed approach is tested on 10 sample problems and the results thus obtained are compared with the existing models in the literature.     

Optimal resource assignment through negotiation in a multi-agent manufacturing system

Research studies on multi-agent systems have been recently boosted by manufacturing and logistics with deep motivations like the presence of independent human deciders with individual goals, the aspiration to dominate the complexity of decision-making in large organizations, the simplicity and robustness of self-reacting distributed systems. After a survey of the multi-agent paradigm and its applications, the paper introduces the notion of hybrid holonic system to study the effect of supervision on a system whose elements negotiate and cooperate in a rule-settled environment to obtain resources for system operation. The supervisor can spur or disincentive agents by assigning/denying resources to them. A simple single-decider optimization model referred to a real application is described, and solution methodologies for optimal resource allocation fitting different scenarios (centralized, distributed, multi-agent) are discussed, identifying ranges of autonomy, quantifying rewarding and defining a negotiation protocol between the agents and the supervisor. Aim of the paper is to describe through an example a general methodology for quantitative decision-making in multi-agent organizations.     

Using a multi-agent system to optimise resource utilisation in multi-site manufacturing facilities

Due to cost economies and better serving the global market, many enterprises expanded their manufacturing environment from a localised, single-site facility to more globalised, multi-site facilities. In order to take advantage of operating multi-site facilities, it is vital to make optimisation decisions of resource utilisation as if these facilities situated across different geographical locations are one integrated facility and take into account of the extended multi-site constraints and variables. This paper proposes a multi-agent system, using its characteristics of autonomy and intelligence, to integrate process planning and production scheduling across different facilities, so as to secure the most efficient and cost-effective plan and schedule to meet the demand. A currency-based agent iterative bidding mechanism is developed to facilitate the co-ordination of agents to achieve the goal. A genetic algorithm is employed to tune the currency values for agent bidding. In this paper, a case study is used for simulation in order to demonstrate the effectiveness and performance of the proposed agent system.     

Development of a parallel processing multi-agent architecture for a virtual CIM system

Global manufacturing enterprises tend to rely on fully integrated manufacturing systems to satisfy constantly changing market requirements. In addition, small to medium enterprises are in a dilemma when competing with large organizations. Virtual computer-integrated manufacturing (VCIM) is a realistic concept that can provide the integration requirements for the globally distributed manufacturing resources and it has the potential to satisfy the market requirements of small to medium enterprises. The vision of the VCIM is to improve the efficiency and effectiveness of manufacturing enterprises by seamlessly integrating globally distributed manufacturing resources as much as possible. Meanwhile, intelligent agent technology provides a better means to implement distributed components as integrated application systems. The paper provides a parallel processing multi-agent architecture to support a global integrated manufacturing system in the form of the VCIM. In this architecture, a three-layered structure is proposed to accommodate all the agents no matter where they are located. Multiple Facilitator agents are proposed with similar functionalities to smooth the information flow across the integrated system in a parallel connection manner. In addition, a multi-agent VCIM model that describes the agent identification approaches for VCIM, Java environment implementation approaches and a simulation system to demonstrate the parallel processing multi-agent architecture are also discussed.     

Using a genetic algorithm to schedule the space-constrained AGV-based prefabricated bathroom units manufacturing system

In this article, scheduling problem of a space-constrained AGV-based prefabricated bathroom units (PBU) manufacturing system is addressed. Space becomes a key resource to this manufacturing system because a very large space is required to accommodate the settling units as well as the queues. Although line balancing helps to reduce the queues, the system is still prone to deadlock due to limited space. Hence, in order to prevent deadlock situations, the production start times of PBUs have to be controlled. A genetic algorithm is proposed with the objective to decide operation for each workstation and to choose a start time for each PBU. The project duration is minimised while satisfying precedence relations and resource availabilities. A rule-based simulation approach is used to estimate the fitness value of every GA chromosomes. At last, the experiment based on data from an industrial project shows that the proposed algorithm has the potential to guide the real practice.     

Control of deadlock and blocking for production systems with unreliable workstations

Over the past decade, the development of supervisory controllers for automated manufacturing systems has been an active area of research with particular attention focusing on deadlock avoidance. Most work to date assumes that system workstations do not fail. This paper considers deadlock and blocking problems in systems with one unreliable workstation, the objective being to develop supervisory control policies that allocate workstation buffer space so that failure of the workstation server does not propagate through blocking to effectively stall other portions of the system. In short, when a workstation fails, the system should automatically continue producing all part types not requiring that workstation. To accomplish this, the supervisory controller must simultaneously avoid deadlock and buffer allocation states that are not feasible initial states for the 'reduced' system resulting from workstation failure. When the workstation fails, the controller must then simultaneously avoid both deadlock and buffer allocation states that are not feasible initial states for the original system so that transition to normal operation is smooth when the failed workstation is restored. This paper shows this class of problems through several examples, identifies properties that controllers must satisfy to deal effectively with these problems and develops a polynomial control policy that satisfies these properties.     

Agent-based design framework for riser and gating system design for sound casting

A multi-agent control framework is proposed that is capable of designing a rising and gating system for a three-dimensional computer-aided design model of a casting. The proposed framework uses autonomous and self-communicating agents to interact with the environment and to extract knowledge from it. Agents are capable of taking the optimal decision related to the various facets of casting design. Information on the computer-aided design model of casting is fed into the system through which a casting agent is generated. Other agents like a riser agent, an ingate agent, a runner agent and a sprue agent are the offshoots emanated from the casting agent. They interact with each other to share detailed information related to the riser and gating system design. The proposed multi-agent framework focuses on autonomous real-time analysis required to generate geometric shapes without much involvement of the user.