A process model for concurrent design in manufacturing enterprise information systems.

Enterprise IS 01/2008; 2:33-46. DOI: 10.1080/17517570701661813
Source: DBLP

ABSTRACT In manufacturing enterprise information systems, concurrent design process is one of the focuses of research on design process management. This study proposes a novel process model for concurrent design based on unified modelling language (UML) and polychromatic sets theory. Model primitives and constructs of UML activity diagram, concurrent design activities, and dynamic changes of concurrent design process are described in the polychromatic sets contour matrix. Based on polychromatic sets theory, the model reduction rules and algorithm are proposed. With the feature-based part design and process planning, a UML model of concurrent design process is developed and mapped into polychromatic sets contour matrix model. The dynamic change, model reduction, path search and time consumption of concurrent design process are analysed, and the direction for improving concurrent design process and shortening product development cycle is suggested.

  • [Show abstract] [Hide abstract]
    ABSTRACT: In order to address the resource service optimal-selection (RSOS) and composition problem in manufacturing grid (MGrid) system and provide high-quality service to users, an MGrid RSOS and composition framework (MGrid-RSOSCF) is investigated in this study. The process of RSOS and composition is divided into the following five steps in MGrid-RSOSCF: (1) decomposing the submitted manufacturing task into several subtasks (i.e. single resource service requested task) if the submitted task is a multiple resource service requested task; (2) searching out the qualified resource service for each decomposed subtask and generating the corresponding candidate resource service set; (3) retrieving, evaluating and comparing the quality of service (QoS) for each candidate resource service, and provide data for service optimal-selection and composition –if the submitted task is a single resource service requested task; (4) evaluating synthetically the overall quality of each candidate resource service and ranking them, and selecting the optimal one for the task – if the submitted manufacturing task is an multiple resource service requested task; (5) selecting one candidate resource service from each candidate resource service set and constructing a new composite resource service according to the submitted task requirements, and collecting all the possible resource service composite execution paths (RSCEP) and selecting the optimal paths to execute the task. The proposed MGrid-RSOSCF consists of five layers and each layer provides the corresponding necessary services and algorithms to address one problem mentioned above. The five layers are: (1) T-layer, responsible for MGrid task decomposition; (2) S-layer, responsible for resource service match and search; (3) Q-layer, responsible for QoS processing; (4) O-layer, responsible for evaluating and ranking the candidate resource service and (5) C-layer is responsible for resource service composition and optimal-selection. The case study and comparison of performances of the algorithms demonstrate that the proposed methods are sound on success rate and executing efficiency.
    Enterprise IS. 01/2012; 6:237-264.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Among distribution centre operations, order picking has been reported to be the most labour-intensive activity. Sophisticated storage assignment policies adopted to reduce the travel distance of order picking have been explored in the literature. Unfortunately, previous research has been devoted to locating entire products from scratch. Instead, this study intends to propose an adaptive approach, a Data Mining-based Storage Assignment approach (DMSA), to find the optimal storage assignment for newly delivered products that need to be put away when there is vacant shelf space in a distribution centre. In the DMSA, a new association index (AIX) is developed to evaluate the fitness between the put away products and the unassigned storage locations by applying association rule mining. With AIX, the storage location assignment problem (SLAP) can be formulated and solved as a binary integer programming. To evaluate the performance of DMSA, a real-world order database of a distribution centre is obtained and used to compare the results from DMSA with a random assignment approach. It turns out that DMSA outperforms random assignment as the number of put away products and the proportion of put away products with high turnover rates increase.
    Enterprise IS. 01/2011; 5:219-234.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In computer-aided tolerance design (CAT), integrated design of dimensional and geometric tolerances is still one of the research hotspots. Polychromatic sets theory (PST) is a new mathematic tool, which is especially suitable for formal hierarchical structure models. Based on PST, in this article, a new hierarchical representation model for tolerance synthesis is presented to realise integrated design of dimensional and geometric tolerances. According to the inference relations between unified and individual colours of PST, the synthesis matrices of variational geometric constraints (VGC) are established in the VGC tier of the model, and the synthesis matrices of tolerance types are established in the tolerance type tier of the model. On this basis, the synthesis processes from the feature tier to the VGC tier and from the VGC tier to the tolerance type tier can be realised. VGCs, which are achieved by the synthesis matrices of VGCs, can be combined together to establish a well-constrained VGC network (VGCN). Tolerance types, which are achieved by the synthesis matrices of tolerance types, can be added to the well-constrained VGCN to construct a well-constrained tolerance network. An application example is given in the article to illustrate the synthesis steps.
    Enterprise IS. 01/2011; 5:337-358.