The sensor–weapon–target allocation (S-WTA) is a typical collaborative task problem involved in network-centric warfare (NCW). existing related studies have limitation to the nature of cooperation and uncertainty an air defense battle scenario, most models assumption that they are determinate, i.e., parameters them known certainly. For actual battlefield environment, asymmetric information it c...

this study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. the problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. the time interval between consecutive maintenance activities as well as the...

in this paper, an efficient extension of network simplex algorithm is presented. in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by network simplex algorithm (nsa) and nsa+, which extended the stand...

The Weapon Target Assignment (WTA) problem is a fundamental defense application of operations research. The problem consists of optimally assigning a given number of weapons to a set of targets so that the post-engagement total expected survival value of the targets is minimized. Since the WTA problem is known to be NP-complete, there are no exact methods to solve it. This paper presents two in...

nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. in some of the applications of unrelated parallel mac...