this paper presents a new nonlinear mathematical model to solve a cell formation problem which assumes that processing time and inter-arrival time of parts are random variables. in this research, cells are defined as a queue system which will be optimized via queuing theory. in this queue system, each machine is assumed as a server and each part as a customer. the grouping of machines and parts...

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

The weak interactive compression conjecture asserts that any two-party communication protocol with communication complexity C and information complexity I can be compressed to a protocol with communication complexity poly(I)polylog(C). We describe a communication problem that is a candidate for refuting that conjecture. Specifically, while we show that the problem can be solved by a protocol wi...

in this paper an application of cellular learning automata (cla) to vlsi placement is presented. the cla, which is introduced for the first time in this paper, is different from standard cellular learning automata in two respects. it has input and the cell neighborhood varies during the operation of cla. the proposed cla based algorithm for vlsi placement is tested on number of placement proble...

Location based services in mobile environments have been recognized as a challenging problem that calls for new service models and dynamic strategies. The problem becomes even harder when not only the clients but also the data sources can move. We tackle the problem by providing a general service architecture that facilitates the employment of mobile codes. We then device a concise but effectiv...

Recently, as the scale, structure, capacity and use of buildings are more complicated in construction projects, it is more difficult to estimation project’s costs. Because its project’s scale is much bigger than any other project’s one and total project cost is concluded after project is finished, it is important to make cost estimation method and system. In past, it is possible to estimate cos...

In this paper, we propose and present the design and initial development of the Fault awareness Enabled Computing Environment (FENCE) system for high end computing. FENCE is a comprehensive fault management system in the sense that it consists of both post and runtime analysis, integrates both proactive and reactive mechanisms, and combines both application level and system level fault manageme...