Abstract
This paper presents a conceptual framework where the development of an information system for aggregate management of virtual / networked enterprises is taking place. Firstly, the general objectives of the system are described. An ontology based development approach is presented, assuming the role of conceptual guidance, both for the requirements analysis and design phases. Finally, a broad specification of aggregate management in this context is described through use cases.

Abstract
This paper introduces a new upper bound to the problem of fitting identical circles into a rectangle. This problem is usually referred to as the ‘cylinder packing problem’ or ‘cylinder palletization’. In practice, it arises when it is desired to maximize the number of cylindrical items packed in an upright position onto a rectangle/pallet. The upper bound developed consists in determining the reduced pallet area by deducting a lower bound for the unused pallet area from the total area of the pallet. The upper bound for the number of identical circles to pack into the pallet is computed by the ratio reduced pallet area/circle area. The results obtained for five distinct sets of problems are analyzed and compared with previous bounds found in the published literature. International Federation of Operational Research Societies 2001.

Abstract
The practical application of data envelopment analysis (DEA) presents a range of procedural issues to be examined and resolved including those relating to the homogeneity of the units under assessment, the input/output set selected, the measurement of those selected variables and the weights attributed to them. Each of these issues can present difficulties in practice. The purpose of this paper is to highlight some of the pitfalls that have been identified in application papers under each of these headings and to suggest protocols to avoid the pitfalls and guide the application of the methodology. © 2001 Elsevier Science B.V.

Abstract
Due to their efficiency and their interesting design and implementation features, metaheuristics have been used for a long time with success, in dealing with combinatorial problems. In recent years they have been applied to the Unit Commitment problem with rather interesting results that justify further research in the area. In this paper we present a Simulated Annealing approach to the Unit Commitment problem. Two coding schemes are compared, new neighbourhood structures are presented and some searching strategies are discussed. Preliminary computational experience, performed on some test instances, shows that this approach is flexible, effective and able to handle variations on the problem structure. © 2001 IEEE.

Abstract
This paper describes the requirements analysis and system specification of an Order Promise module to be used as part of a broader Decision Support System for production and operations planning of a Virtual Enterprise. This work is part of a broader project with a particular focus on the microelectronics industry which is a good example of Virtual Enterprise, and where a quick response to the customers needs and to unpredictable changes in production conditions is considered a major factor for success. First, the analysis and specification are presented within a development framework that involves the study of organizational issues of semiconductor enterprises. The use of ontological engineering for supporting the communication and shared understanding of the system concepts is explained and a virtual enterprise ontology is outlined. Following the clarification of the concept of virtual enterprise, the generic techno-organizational requirements for the information system are derived. Finally, a specification of the global planning module and a more detailed one regarding the order promise module is presented.

Abstract
From the general trend towards global markers and a growing customer orientation, new concepts and forms of organisation are emerging, such as distributed or networked enterprises. One key requirement of these new paradigms is the availability of models and tools to support order negotiation with the optimisation of manufacturing routes and logistics and ensuring the co-ordination of all participating entities. We address the problem of planning an incoming customer order to be produced in a distributed (multi-site) and multi-stage production system, in particular, we have used as a case study the industry of semiconductors (in the business area of application specific integrated circuits). The problem is tackled in a hierarchical model, in two levels: there is a global network planning procedure, and a set of local capacity models associated to the different production units reflecting their particular features. An approach based on simulated annealing is presented, as well as a specially designed constructive heuristic, that takes into account many of the real world constraints and complexities. The general performance of the simulated annealing algorithm is assessed through some preliminary computational experiments. Finally, some concluding remarks and current directions of research are presented.