Weapon Target Assignment is not only an important issue to use firepower, but also an important operational decision-making problem. As new intelligent algorithms, Genetic algorithm and ant colony algorithm are applied to solve Weapons-Target Assignment Problem. This paper introduces the Weapon-Target Assignment (WTA) and the mathematical model, and proposes ACGA algorithm which is the integrat...

preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...

During the last years, weighted timed automata (WTA) have received much interest in the real-time community. Weighted timed automata form an extension of timed automata and allow us to assign weights (costs) to both locations and edges. This model, introduced by Alur et al. (2001) and Behrmann et al. (2001), permits the treatment of continuous consumption of resources and has led to much resear...

Coordinating agents to complete a set of tasks with intercoupled temporal and resource constraints is computationally challenging, yet human domain experts can solve these difficult scheduling problems using paradigms learned through years of apprenticeship. A process for manually codifying this domain knowledge within a computational framework is necessary to scale beyond the “singleexpert, si...

this paper presents a simplifiedlagrangian multiplier based algorithm to solve the fixed head hydrothermalscheduling problem. in fixed head hydrothermal scheduling problem, waterdischarge rate is modeled as quadratic function of hydropower generation andfuel cost is modeled as quadratic function of thermal power generation. thepower output of each hydro unit varies with the rate of water discha...

We propose a winner-takes-all (WTA) classifier for structures represented by graphs. WTA classification follows the principle elimination of competition. The input structure is assigned to the class corresponding to the winner of the competition. In experiments we investigate the performance of the WTA classifier and compare it with the canonical maximum similarity (MS) classifier.

Article history: Received 22 May 2006 Received in revised form 4 July 2007 Accepted 6 July 2007 Available online 1 August 2007 This paper highlights how farmers' willingness to supply non-marketed ecosystem services (ES) is influenced by whether or not the non-marketed ES are produced jointly with agricultural products. When marketed products and non-marketed ES share some production inputs the...

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique...

This paper presents, formalises and classifies working time accounts (WTAs), a means of achieving flexible production capacity through the flexible organisation of working time. We propose linear programming models to plan working time, using WTA, at companies in the service industry. A computational experiment shows that the models can be solved for any planning problems of reasonable size.