Thomas Karcher Institute for Program Structures and Data Organization Karlsruhe Institute of Technology 76128 Karlsruhe, Germany [email protected] Christopher Guckes Institute for Program Structures and Data Organization Karlsruhe Institute of Technology 76128 Karlsruhe, Germany [email protected] Walter F. Tichy Institute for Program Structures and Data Organization Karlsruhe Institute...

Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into one of two main families: local search algorithms and systematic algorithms. Both families have their own advantages, Designing hybrid approaches seem promising since those advantages may be combined into a single approach. In this paper, we propose a new hybrid technique which performs an overall local searc...

Service-oriented architectures (SOA) and, in particular, Web Services designs are widely adopted for the development of interoperable systems. In a dynamic scenario, a composed service may exploit component services in order to complete its task; composed services are variously distributed, and offered by different providers in different security domains and under different load conditions. So,...

A frequently occurring operational problem is one of processing a given number of jobs (commodities) on a specified number of machines (facilities) referred to by various investigators as scheduling, dispatching, sequencing, or combinations thereof (Gupta and Stafford, 2006). In most manufacturing environments, a set of processes is needed to be serially performed in several stages before a job...

This paper presents the application of self organinsing migration algorithm (SOMA) to the scheduling problem of flow shop. Flow shop is regarded as the most widely utilized shop management system. Two different benchmark problems are attempted with good results obatined both in comparison with the optimal and other published heuristics. INTRODUCTION Advanced manufacturing systems often rely on ...