A deployment-friendly decentralized scheduling approach for cooperative multi-agent systems in production systems

Abstract Decentralized control paradigms are becoming more and more attractive in an ever-changing commercial environment, where there is a strong trend towards smaller production lot sizes. Whereas centralized scheduling might find a global throughput optimum (even at high computational and implementation cost), decentralized scheduling decisions in a multi-agent system are much more manageable and agents are more robust to handle any interruptions that might take place on the production floor. Compared to a centralised architecture, the development, testing and commissioning is definitely more complex, as it requires the availability of the physical units. Yet these aspects are not visited frequently by research activities. This paper details a novel implementation approach of a multi-agent based production control, that was developed for a lab-contained production environment that serves as test-bed for decentralized scheduling algorithms, with both a nominal operational mode and a simulation mode. The latter one is introduced to ease up the deployment process of the system. The description of the new approach is illustrated with different examples

Agent-based Three Layer Framework of Assembly-Oriented Planning and Scheduling for Discrete Manufacturing Enterprises

To solve the cost burden caused by delivery tardiness for small and medium sized packaging machinery enterprises, the assembly-oriented planning and scheduling is studied based on the multi-agent technology. Taking into account the due date, the planning and scheduling are optimized iteratively with the rule-based algorithms complying with the machining and assembling process constraints. To make the realistic large-scale production planning scheme tailored to fit the optimization algorithms, a multi-agent system is utilized to conceptually construct a three-layer framework corresponding to three planning horizons of different task level. These planning horizons are quarter/month of product/subassembly level, week of part level, and day of operation level. With the strategy of combining top-down task decomposition and bottom-up plan update (where the quarterly orders are decomposed into the monthly, weekly, and daily tasks according to the product processing structure while the resulting plans of every layer are updated iteratively based on the bottom layer optimization), the proposed framework not only addresses the planning but also the periodic and event-driven scheduling of the processes. In this paper, a gravure printing machine is considered as a test case for evaluating the proposed framework. The simulation results with the historical data of the orders for this machine demonstrate the effectiveness of the proposed scheme on the control of the distribution of idle-time. It can also provide a resolution to tardiness penalty for small and medium sized enterprises

Scheduling of non-repetitive lean manufacturing systems under uncertainty using intelligent agent simulation

World-class manufacturing paradigms emerge from specific types of manufacturing systems with which they remain associated until they are obsolete. Since its introduction the lean paradigm is almost exclusively implemented in repetitive manufacturing systems employing flow-shop layout configurations. Due to its inherent complexity and combinatorial nature, scheduling is one application domain whereby the implementation of manufacturing philosophies and best practices is particularly challenging. The study of the limited reported attempts to extend leanness into the scheduling of non-repetitive manufacturing systems with functional shop-floor configurations confirms that these works have adopted a similar approach which aims to transform the system mainly through reconfiguration in order to increase the degree of manufacturing repetitiveness and thus facilitate the adoption of leanness. This research proposes the use of leading edge intelligent agent simulation to extend the lean principles and techniques to the scheduling of non-repetitive production environments with functional layouts and no prior reconfiguration of any form. The simulated system is a dynamic job-shop with stochastic order arrivals and processing times operating under a variety of dispatching rules. The modelled job-shop is subject to uncertainty expressed in the form of high priority orders unexpectedly arriving at the system, order cancellations and machine breakdowns. The effect of the various forms of the stochastic disruptions considered in this study on system performance prior and post the introduction of leanness is analysed in terms of a number of time, due date and work-in-progress related performance metrics

Design choices for agent-based control of AGVs in the dough making process

In this paper we consider a multi-agent system (MAS) for the logistics control of Automatic Guided Vehicles (AGVs) that are used in the dough making process at an industrial bakery. Here, logistics control refers to constructing robust schedules for all transportation jobs. The paper discusses how alternative MAS designs can be developed and compared using cost, frequency of messages between agents, and computation time for evaluating control rules as performance indicators. Qualitative design guidelines turn out to be insufficient to select the best agent architecture. Therefore, we also use simulation to support decision making, where we use real-life data from the bakery to evaluate several alternative designs. We find that architectures in which line agents initiate allocation of transportation jobs, and AGV agents schedule multiple jobs in advance, perform best. We conclude by discussing the benefits of our MAS systems design approach for real-life applications

Agent-based transportation planning compared with scheduling heuristics

Here we consider the problem of dynamically assigning vehicles to transportation orders that have di¤erent time windows and should be handled in real time. We introduce a new agent-based system for the planning and scheduling of these transportation networks. Intelligent vehicle agents schedule their own routes. They interact with job agents, who strive for minimum transportation costs, using a Vickrey auction for each incoming order. We use simulation to compare the on-time delivery percentage and the vehicle utilization of an agent-based planning system to a traditional system based on OR heuristics (look-ahead rules, serial scheduling). Numerical experiments show that a properly designed multi-agent system may perform as good as or even better than traditional methods

Production/maintenance cooperative scheduling using multi-agents and fuzzy logic

Within companies, production is directly concerned with the manufacturing schedule, but other services like sales, maintenance, purchasing or workforce management should also have an influence on this schedule. These services often have together a hierarchical relationship, i.e. the leading function (most of the time sales or production) generates constraints defining the framework within which the other functions have to satisfy their own objectives. We show how the multi-agent paradigm, often used in scheduling for its ability to distribute decision-making, can also provide a framework for making several functions cooperate in the schedule performance. Production and maintenance have been chosen as an example: having common resources (the machines), their activities are actually often conflicting. We show how to use a fuzzy logic in order to model the temporal degrees of freedom of the two functions, and show that this approach may allow one to obtain a schedule that provides a better compromise between the satisfaction of the respective objectives of the two functions

Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems

We consider the real-time scheduling of full truckload transportation orders with time windows that arrive during schedule execution. Because a fast scheduling method is required, look-ahead heuristics are traditionally used to solve these kinds of problems. As an alternative, we introduce an agent-based approach where intelligent vehicle agents schedule their own routes. They interact with job agents, who strive for minimum transportation costs, using a Vickrey auction for each incoming order. This approach offers several advantages: it is fast, requires relatively little information and facilitates easy schedule adjustments in reaction to information updates. We compare the agent-based approach to more traditional hierarchical heuristics in an extensive simulation experiment. We find that a properly designed multiagent approach performs as good as or even better than traditional methods. Particularly, the multi-agent approach yields less empty miles and a more stable service level