Division of Labour and Social Coordination Modes : A simple simulation model

This paper presents a preliminary investigation of the relationship between the process of functional division of labour and the modes in which activities and plans are coordinated. We consider a very simple production process: a given heap of bank-notes has to be counted by a group of accountants. Because of limited individual capabilities and/or the possibilities of mistakes and external disturbances, the task has to be divided among several accountants and a hierarchical coordination problem arises. We can imagine several different ways of socially implementing coordination of devided tasks. 1) a central planner can compute the optimal architecture of the system; 2) a central planner can promote quantity adjustments by moving accountants from hierarchical levels where there exist idle resources to levels where resources are insufficient; 3) quasi-market mechanisms can use quantity or price signals for promoting decentralized adjustments. By means of a simple simulation model, based on Genetic Algorithms and Classifiers Systems, we can study the dynamic efficiency properties of each coordination mode and in particular their capability, speed and cost of adaptation to changing environmental situations (i.e. variations of the size of the task and/or variations of agents' capabilities). Such interesting issues as returns to scale, specialization and workers exploitation can be easily studied in the same model

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

A review of data visualization: opportunities in manufacturing sequence management.

Data visualization now benefits from developments in technologies that offer innovative ways of presenting complex data. Potentially these have widespread application in communicating the complex information domains typical of manufacturing sequence management environments for global enterprises. In this paper the authors review the visualization functionalities, techniques and applications reported in literature, map these to manufacturing sequence information presentation requirements and identify the opportunities available and likely development paths. Current leading-edge practice in dynamic updating and communication with suppliers is not being exploited in manufacturing sequence management; it could provide significant benefits to manufacturing business. In the context of global manufacturing operations and broad-based user communities with differing needs served by common data sets, tool functionality is generally ahead of user application

Internet enabled modelling of extended manufacturing enterprises using the process based techniques

The paper presents the preliminary results of an ongoing research project on Internet enabled process-based modelling of extended manufacturing enterprises. It is proposed to apply the Open System Architecture for CIM (CIMOSA) modelling framework alongside with object-oriented Petri Net models of enterprise processes and object-oriented techniques for extended enterprises modelling. The main features of the proposed approach are described and some components discussed. Elementary examples of object-oriented Petri Net implementation and real-time visualisation are presented

Subtyping for Hierarchical, Reconfigurable Petri Nets

Hierarchical Petri nets allow a more abstract view and reconfigurable Petri nets model dynamic structural adaptation. In this contribution we present the combination of reconfigurable Petri nets and hierarchical Petri nets yielding hierarchical structure for reconfigurable Petri nets. Hierarchies are established by substituting transitions by subnets. These subnets are themselves reconfigurable, so they are supplied with their own set of rules. Moreover, global rules that can be applied in all of the net, are provided